Sciweavers

66 search results - page 8 / 14
» Analyzing Completeness and Correctness of Utterances Using a...
Sort
View
CORR
2008
Springer
97views Education» more  CORR 2008»
13 years 7 months ago
Lower bounds for adaptive linearity tests
Linearity tests are randomized algorithms which have oracle access to the truth table of some function f, and are supposed to distinguish between linear functions and functions whi...
Shachar Lovett
ADBIS
2004
Springer
124views Database» more  ADBIS 2004»
14 years 24 days ago
Database Caching - Towards a Cost Model for Populating Cache Groups
Web caching keeps single Web objects ready somewhere in caches in the user-to-server path, whereas database caching uses fullfledged database management systems as caches to adapt...
Theo Härder, Andreas Bühmann
FMCAD
2004
Springer
14 years 23 days ago
Proof Styles in Operational Semantics
Abstract. We relate two well-studied methodologies in deductive verification of operationally modeled sequential programs, namely the use of inductive invariants and clock functio...
Sandip Ray, J. Strother Moore
SODA
2008
ACM
108views Algorithms» more  SODA 2008»
13 years 8 months ago
Dimension augmentation and combinatorial criteria for efficient error-resistant DNA self-assembly
DNA self-assembly has emerged as a rich and promising primitive for nano-technology. Experimental and analytical evidence indicates that such systems are prone to errors, and acco...
Ho-Lin Chen, Ashish Goel, Chris Luhrs
DATE
2009
IEEE
90views Hardware» more  DATE 2009»
14 years 2 months ago
Property analysis and design understanding
—Verification is a major issue in circuit and system design. Formal methods like bounded model checking (BMC) can guarantee a high quality of the verification. There are severa...
Ulrich Kühne, Daniel Große, Rolf Drechs...