21 search results - page 4 / 5 » On the Sensitivity of Cyclically-Invariant Boolean Functions |
FOCS
2002
IEEE
13 years 10 months ago
2002
IEEE
We give the first polynomial time algorithm to learn any function of a constant number of halfspaces under the uniform distribution on the Boolean hypercube to within any constan...
DATE
2000
IEEE
13 years 10 months ago
2000
IEEE
The Boolean satisfiability problem (SAT) has various applications in electronic design automation (EDA) fields such as testing, timing analysis and logic verification. SAT has bee...
BMCBI
2008
13 years 5 months ago
2008
Background: Genes interact with each other as basic building blocks of life, forming a complicated network. The relationship between groups of genes with different functions can b...
DAC
2009
ACM
14 years 6 months ago
2009
ACM
This paper describes a function-based timing-driven optimization technique for the synthesis of multi-level logic circuits. Motivated by the principles of parallel prefix computat...
CSB
2005
IEEE
13 years 11 months ago
2005
IEEE
Specific topic search in the PubMed Database, one of the most important information resources for scientific community, presents a big challenge to the users. The researcher typic...