Sciweavers

290 search results - page 51 / 58
» Lattice-based computation of Boolean functions
Sort
View
DAC
1995
ACM
13 years 11 months ago
Synthesis of Software Programs for Embedded Control Applications
— Software components for embedded reactive real-time applications must satisfy tight code size and runtime constraints. Cooperating finite state machines provide a convenient i...
Massimiliano Chiodo, Paolo Giusto, Attila Jurecska...
JCB
2002
131views more  JCB 2002»
13 years 7 months ago
Modeling and Simulation of Genetic Regulatory Systems: A Literature Review
In order to understand the functioning of organisms on the molecular level, we need to know which genes are expressed, when and where in the organism, and to which extent. The reg...
Hidde de Jong
FOCS
2010
IEEE
13 years 5 months ago
A Fourier-Analytic Approach to Reed-Muller Decoding
Abstract. We present a Fourier-analytic approach to list-decoding Reed-Muller codes over arbitrary finite fields. We use this to show that quadratic forms over any field are locall...
Parikshit Gopalan
COCO
1999
Springer
101views Algorithms» more  COCO 1999»
13 years 12 months ago
A Lower Bound for Primality
Recent work by Bernasconi, Damm and Shparlinski showed that the set of square-free numbers is not in AC0 , and raised as an open question whether similar (or stronger) lower bound...
Eric Allender, Michael E. Saks, Igor Shparlinski
STACS
1997
Springer
13 years 11 months ago
Predecessor Queries in Dynamic Integer Sets
We consider the problem of maintaining a set of n integers in the range 0::2w ? 1 under the operations of insertion, deletion, predecessor queries, minimum queries and maximum quer...
Gerth Stølting Brodal