4255 search results - page 438 / 851 » On Learning Boolean Functions |
194
click to vote
ICFP
2007
ACM
16 years 6 months ago
2007
ACM
We analyze the computational complexity of kCFA, a hierarchy of control flow analyses that determine which functions may be applied at a given call-site. This hierarchy specifies ...
144
click to vote
WABI
2004
Springer
16 years 4 days ago
2004
Springer
We consider the problem of finding the optimal pair of string patterns for discriminating between two sets of strings, i.e. finding the pair of patterns that is best with respect...
191
click to vote
FC
1997
Springer
15 years 11 months ago
1997
Springer
Abstract. SPEED is a private key block cipher. It supports three variable parameters: (1) data length — the length of a plaintext/ciphertext of SPEED can be 64, 128 or 256 bits. ...
231
click to vote
FLOPS
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. Assertion-based contracts provide a powerful mechanism for stating invariants at module boundaries and for enforcing them uniformly. In 2002, Findler and Felleisen showed...
211
click to vote
BMCBI
2008
15 years 6 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...