116 search results - page 13 / 24 » Complexity Reduction Using Expansive Coding |
PEPM
1994
ACM
13 years 11 months ago
1994
ACM
It is well-known that self-applicable partial evaluation can be used to generate compiler generators: cogen = mix(mix;mix), where mix is the specializer (partial evaluator). Howev...
COCO
2011
Springer
12 years 7 months ago
2011
Springer
Let f ∈ Fq[x] be a polynomial of degree d ≤ q/2. It is well-known that f can be uniquely recovered from its values at some 2d points even after some small fraction of the valu...
ICALP
2000
Springer
13 years 11 months ago
2000
Springer
In this paper, we provide a method to safely store a document in perhaps the most challenging settings, a highly decentralized replicated storage system where up to half of the st...
ICSE
2003
IEEE-ACM
14 years 7 months ago
2003
IEEE-ACM
We present a new methodology for automatic verification of C programs against finite state machine specifications. Our approach is compositional, naturally enabling us to decompos...
DDECS
2006
IEEE
14 years 1 months ago
2006
IEEE
- Extension of a BIST design algorithm is proposed in this paper. The method is based on a synthesis of a combinational block - the decoder, transforming pseudo-random code words i...