Sciweavers

4255 search results - page 154 / 851
» On Learning Boolean Functions
Sort
View
CF
2008
ACM
15 years 2 days ago
Exact combinational logic synthesis and non-standard circuit design
Using a new exact synthesizer that automatically induces minimal universal boolean function libraries, we introduce two indicators for comparing their expressiveness: the first ba...
Paul Tarau, Brenda Luderman
ECCC
2010
80views more  ECCC 2010»
14 years 10 months ago
Query Complexity in Errorless Hardness Amplification
An errorless circuit for a boolean function is one that outputs the correct answer or "don't know" on each input (and never outputs the wrong answer). The goal of e...
Thomas Watson
CORR
2010
Springer
164views Education» more  CORR 2010»
14 years 8 months ago
Is submodularity testable?
: We initiate the study of property testing of submodularity on the boolean hypercube. Submodular functions come up in a variety of applications in combinatorial optimization. For ...
C. Seshadhri, Jan Vondrák
JMLR
2010
147views more  JMLR 2010»
14 years 4 months ago
Gaussian Processes for Machine Learning (GPML) Toolbox
The GPML toolbox provides a wide range of functionality for Gaussian process (GP) inference and prediction. GPs are specified by mean and covariance functions; we offer a library ...
Carl Edward Rasmussen, Hannes Nickisch
ICCAD
2008
IEEE
140views Hardware» more  ICCAD 2008»
15 years 7 months ago
To SAT or not to SAT: Ashenhurst decomposition in a large scale
Functional decomposition is a fundamental operation in logic synthesis. Prior BDD-based approaches to functional decomposition suffer from the memory explosion problem and do not...
Hsuan-Po Lin, Jie-Hong Roland Jiang, Ruei-Rung Lee