Sciweavers

5227 search results - page 280 / 1046
» Constructing New Media
Sort
View
ICCD
2004
IEEE
115views Hardware» more  ICCD 2004»
16 years 4 months ago
Generating Monitor Circuits for Simulation-Friendly GSTE Assertion Graphs
Formal and dynamic (simulation, emulation, etc.) verification techniques are both needed to deal with the overall challenge of verification. Ideally, the same specification/tes...
Kelvin Ng, Alan J. Hu, Jin Yang
COCO
2007
Springer
96views Algorithms» more  COCO 2007»
16 years 1 months ago
Unbalanced Expanders and Randomness Extractors from Parvaresh-Vardy Codes
We give an improved explicit construction of highly unbalanced bipartite expander graphs with expansion arbitrarily close to the degree (which is polylogarithmic in the number of ...
Venkatesan Guruswami, Christopher Umans, Salil P. ...
164
Voted
GECCO
2009
Springer
139views Optimization» more  GECCO 2009»
16 years 2 days ago
Meta-heuristics for reconstructing cross cut shredded text documents
In this work, we present two new approaches based on variable neighborhood search (VNS) and ant colony optimization (ACO) for the reconstruction of cross cut shredded text documen...
Matthias Prandtstetter, Günther R. Raidl
172
Voted
FM
1999
Springer
109views Formal Methods» more  FM 1999»
15 years 11 months ago
Compositional Symmetric Sharing in B
Sharing between B constructs is limited, both on the specification and the implementation level. The limitations stem from the single writer/multiple readers paradigm, restricted ...
Martin Büchi, Ralph-Johan Back
ACNS
2007
Springer
96views Cryptology» more  ACNS 2007»
15 years 11 months ago
Universal Accumulators with Efficient Nonmembership Proofs
Based on the notion of accumulators, we propose a new cryptographic scheme called universal accumulators. This scheme enables one to commit to a set of values using a short accumul...
Jiangtao Li, Ninghui Li, Rui Xue