Filters








3,051 Hits in 3.1 sec

Optimal single-copy measurement for the hidden-subgroup problem

Dave Bacon, Thomas Decker
2008 Physical Review A. Atomic, Molecular, and Optical Physics  
Here we describe the optimal single copy measurement for the hidden subgroup problem when all of the subgroups of the group are given with equal a priori probability.  ...  Previous work has identified the optimal single copy measurement for the hidden subgroup problem over abelian groups as well as for the non-abelian problem in the setting where the subgroups are restricted  ...  Bacon, Childs, and van Dam showed that the PGM was optimal for the dihedral and Heisenberg HSPs for both the single and multi-copy case and when the subgroups were restricted to certain order 2 or order  ... 
doi:10.1103/physreva.77.032335 fatcat:kiuv3nrjhja3haresx7zgmf5ja

Functional 3D Graphics in C++ — with an Object-Oriented, Multiple Dispatching Implementation [chapter]

Greg Schechter, Conal Elliott, Ricky Yeung, Salim Abi-Ezzi
1996 Object-Oriented and Mixed Programming Paradigms  
It has been our experience that the resulting programs are quite succinct and comprehensible, and execute efficiently.  ...  This latter approach forces geometry description to be order-dependent (thus eliminating opportunities for optimizations based on primitive re-ordering), and hence non-declarative.  ...  It also leaves less room for the implementation to transparently perform geometry optimizations. Why is TBAG so much more succinct and expressive than other systems?  ... 
doi:10.1007/978-3-642-61062-2_13 dblp:conf/oographics/SchechterEYA94 fatcat:mjfjcmvmang4llrteoevlw5lba

Encoding Functions with Constant Online Rate, or How to Compress Garbled Circuit Keys

Benny Applebaum, Yuval Ishai, Eyal Kushilevitz, Brent Waters
2015 SIAM journal on computing (Print)  
These include protocols for secure multiparty computation and for non-interactive verifiable computation in the preprocessing model which achieve, for the first time, an optimal online communication complexity  ...  The group order p is explicitly included in param.  ...  DDH n bits + n add's n 2 n 2 exp's n 2 group mul's over G of order p 1 element in Z p G elements + single exp.  ... 
doi:10.1137/130929643 fatcat:pwv2vdym4jeptaawxgca2pygxe

Modeling Higher-Order Correlations within Cortical Microcolumns

Urs Köster, Jascha Sohl-Dickstein, Charles M. Gray, Bruno A. Olshausen, Jakob H. Macke
2014 PLoS Computational Biology  
Boltzmann Machines with hidden units provide a succinct and effective way to capture these dependencies without increasing the difficulty of model estimation and evaluation.  ...  The higher-order models reveal localized activity patterns which reflect the laminar organization of neurons within a cortical column.  ...  The more succinct explanation for dependencies between recorded neurons is via connections to Author Summary Communication between neurons underlies all perception and cognition.  ... 
doi:10.1371/journal.pcbi.1003684 pmid:24991969 pmcid:PMC4081002 fatcat:dewfdxyorbcynjc7vdnechswse

How to Obfuscate Programs Directly [chapter]

Joe Zimmerman
2015 Lecture Notes in Computer Science  
We prove virtual black-box (VBB) security for our construction in a generic model of multilinear maps of hidden composite order, extending previous models for the prime-order setting.  ...  We propose a new way to obfuscate programs, using composite-order multilinear maps.  ...  For one, our construction relies on the fact that the multilinear map has (hidden) composite order, in order to implement encodings of direct products via the Chinese Remainder Theorem.  ... 
doi:10.1007/978-3-662-46803-6_15 fatcat:6wnoonhj6feblo65oi4xwkxlpu

Commutative set

Prakash Prabhu, Soumyadeep Ghosh, Yun Zhang, Nick P. Johnson, David I. August
2011 SIGPLAN notices  
COMMSET expressions are syntactically succinct and enable the programmer to specify commutativity relations between groups of arbitrary structured code blocks.  ...  Sequential programming models express a total program order, of which a partial order must be respected. This inhibits parallelizing tools from extracting scalable performance.  ...  Acknowledgments We thank the entire Liberty Research Group for their support and feedback during this work. We also thank the anonymous reviewers for their insightful comments.  ... 
doi:10.1145/1993316.1993500 fatcat:ty5kjyfi7ja3jbpekkvdvhexbe

Commutative set

Prakash Prabhu, Soumyadeep Ghosh, Yun Zhang, Nick P. Johnson, David I. August
2012 SIGPLAN notices  
COMMSET expressions are syntactically succinct and enable the programmer to specify commutativity relations between groups of arbitrary structured code blocks.  ...  Sequential programming models express a total program order, of which a partial order must be respected. This inhibits parallelizing tools from extracting scalable performance.  ...  Acknowledgments We thank the entire Liberty Research Group for their support and feedback during this work. We also thank the anonymous reviewers for their insightful comments.  ... 
doi:10.1145/2345156.1993500 fatcat:26vqyfaaknaxnpr6khngjlicza

Commutative set

Prakash Prabhu, Soumyadeep Ghosh, Yun Zhang, Nick P. Johnson, David I. August
2011 Proceedings of the 32nd ACM SIGPLAN conference on Programming language design and implementation - PLDI '11  
COMMSET expressions are syntactically succinct and enable the programmer to specify commutativity relations between groups of arbitrary structured code blocks.  ...  Sequential programming models express a total program order, of which a partial order must be respected. This inhibits parallelizing tools from extracting scalable performance.  ...  Acknowledgments We thank the entire Liberty Research Group for their support and feedback during this work. We also thank the anonymous reviewers for their insightful comments.  ... 
doi:10.1145/1993498.1993500 dblp:conf/pldi/PrabhuGZJA11 fatcat:6eztrtqcergylmjx4vzm2itlle

Encoding Functions with Constant Online Rate or How to Compress Garbled Circuits Keys [chapter]

Benny Applebaum, Yuval Ishai, Eyal Kushilevitz, Brent Waters
2013 Lecture Notes in Computer Science  
These include protocols for secure multiparty computation and for non-interactive verifiable computation in the preprocessing model which achieve, for the first time, an optimal online communication complexity  ...  Succinct AREs for Boolean Circuits In this section, we will encode any efficiently computable function via a succinct encoding.  ...  We prove thatĥ(m, x; r) is computationally indistinguishable from h(m , x; r) via a hybrid argument as follows.  ... 
doi:10.1007/978-3-642-40084-1_10 fatcat:e4bhvkik3vcpfccot3c6omgvtq

Group-Based Secure Computation: Optimizing Rounds, Communication, and Computation [chapter]

Elette Boyle, Niv Gilboa, Yuval Ishai
2017 Lecture Notes in Computer Science  
[BGI16] introduced a new technique for succinct secure computation that can be based on any DDH-hard group.  ...  We present several techniques for improving the computational cost of the share conversion procedure of Boyle et al., improving the concrete efficiency of group-based protocols by several orders of magnitude  ...  We note that the latter optimizations do not apply to Elliptic Curve groups, and hence do not provide the optimal level of succinctness.  ... 
doi:10.1007/978-3-319-56614-6_6 fatcat:bhgipsvgsvd53caixzg45iybem

Inference of compact nonlinear dynamic models by epigenetic local search

William La Cava, Kourosh Danai, Lee Spector
2016 Engineering applications of artificial intelligence  
In the algebraic approach, un-measured states, denotedx, 107 are estimated from measurements via numerical differentiation together with smoothing functions. 108 In the case of first-order differential  ...  We begin by testing 81 the method on a large set of data obtained from simulated nonlinear ODEs in different engineering 82 fields, in order to illustrate its breadth of application.  ...  The number of solutions found, 482 and the computational effort to reach those solutions, are plotted in Figures 7 and 8, respectively. 483 The results are broken into groups based on the number of arguments  ... 
doi:10.1016/j.engappai.2016.07.004 fatcat:pce73g5byzfdvcbxjpz42zvamu

Cimple: Instruction and Memory Level Parallelism [article]

Vladimir Kiriansky, Haoran Xu, Martin Rinard, Saman Amarasinghe
2018 arXiv   pre-print
Modern out-of-order processors have increased capacity to exploit instruction level parallelism (ILP) and memory level parallelism (MLP), e.g., by using wide superscalar pipelines and vector execution  ...  AMAC [30] is an extension to group prefetching to immediately refill completed tasks in order to handle skewed inputs.  ...  A homogeneous scheduler runs identical coroutines with the same shared arguments. New tasks can either be pulled via a scheduler callback, or pushed when available.  ... 
arXiv:1807.01624v1 fatcat:p57lcohyh5e2rdebufx5v2lxta

Succinct Greedy Graph Drawing in the Hyperbolic Plane [article]

David Eppstein, Michael T. Goodrich
2008 arXiv   pre-print
More importantly, for networking applications, our algorithm produces succinct drawings, in that each of the vertex positions in one of our embeddings can be represented using O(log n) bits and the calculation  ...  using an asymptotically optimal number of bits.  ...  The Importance of Succinctness Unfortunately, all of the algorithms mentioned above for producing greedy embeddings, including the hyperbolic-space solution of Kleinberg [11] , contain a hidden drawback  ... 
arXiv:0806.0341v1 fatcat:wntdkv5slffxtftaz5rwrizbiq

Succinct Greedy Graph Drawing in the Hyperbolic Plane [chapter]

David Eppstein, Michael T. Goodrich
2009 Lecture Notes in Computer Science  
Our algorithm produces succinct drawings, where vertex positions are represented using O(log n) bits and distance comparisons may be performed efficiently using these representations.  ...  optimal number of bits.  ...  Third, if x = x and the eventual destination is reached via the parent of x, the step is greedy for the same reason as in the second case: the nodes that are mapped to x form a heavy path placed in order  ... 
doi:10.1007/978-3-642-00219-9_3 fatcat:sgqjl4cvjndunapbssjisqghem

On Query Algebras for Probabilistic Databases

Christoph Koch
2009 SIGMOD record  
In essence, this core is part of the query languages of most probabilistic database systems proposed so far, but is sometimes hidden in complex language definitions.  ...  Arithmetic expressions may occur in atomic conditions and in the arguments of π and ρ.  ...  expressible in second-order logic.  ... 
doi:10.1145/1519103.1519116 fatcat:ex2el4xphvdzdo6hjxvqgmgnne
« Previous Showing results 1 — 15 out of 3,051 results