Sciweavers

373 search results - page 46 / 75
» Learning Arithmetic Circuits
Sort
View
SIAMCOMP
2010
174views more  SIAMCOMP 2010»
13 years 6 months ago
On the Complexity of Nash Equilibria and Other Fixed Points
We reexamine what it means to compute Nash equilibria and, more generally, what it means to compute a fixed point of a given Brouwer function, and we investigate the complexity o...
Kousha Etessami, Mihalis Yannakakis
PKC
2012
Springer
255views Cryptology» more  PKC 2012»
11 years 10 months ago
Better Bootstrapping in Fully Homomorphic Encryption
Gentry’s bootstrapping technique is currently the only known method of obtaining a “pure” fully homomorphic encryption (FHE) schemes, and it may offers performance advantage...
Craig Gentry, Shai Halevi, Nigel P. Smart
COMPUTER
2007
117views more  COMPUTER 2007»
13 years 7 months ago
Digital Technology and the Skills Shortage
ract in that they deal with sequences of sound or movement. Two social or personality skills can also be defined: Intrapersonal skill helps people perceive and control their own th...
W. Neville Holmes
DAC
2003
ACM
14 years 8 months ago
Support vector machines for analog circuit performance representation
The use of Support Vector Machines (SVMs) to represent the performance space of analog circuits is explored. In abstract terms, an analog circuit maps a set of input design parame...
Fernando De Bernardinis, Michael I. Jordan, Albert...
SAT
2009
Springer
158views Hardware» more  SAT 2009»
14 years 2 months ago
Beyond CNF: A Circuit-Based QBF Solver
State-of-the-art solvers for Quantified Boolean Formulas (QBF) have employed many techniques from the field of Boolean Satisfiability (SAT) including the use of Conjunctive Norm...
Alexandra Goultiaeva, Vicki Iverson, Fahiem Bacchu...