Sciweavers

467 search results - page 43 / 94
» Designer Definites in Logical Form
Sort
View
CSFW
2012
IEEE
11 years 11 months ago
Generic Indifferentiability Proofs of Hash Designs
—In this paper, we propose a formal analysis of domain extenders for hash functions in the indifferentiability framework. We define a general model for domain extenders and prov...
Marion Daubignard, Pierre-Alain Fouque, Yassine La...
VLDB
1998
ACM
134views Database» more  VLDB 1998»
14 years 1 months ago
Design, Implementation, and Performance of the LHAM Log-Structured History Data Access Method
Numerous applications such as stock market or medical information systems require that both historical and current data be logically integrated into a temporal database. The under...
Peter Muth, Patrick E. O'Neil, Achim Pick, Gerhard...
DAC
2007
ACM
14 years 10 months ago
Alembic: An Efficient Algorithm for CNF Preprocessing
Satisfiability (SAT) solvers often benefit from a preprocessing of the formula to be decided. For formulae in conjunctive normal form (CNF), subsumed clauses may be removed or par...
HyoJung Han, Fabio Somenzi
VLDB
1995
ACM
103views Database» more  VLDB 1995»
14 years 18 days ago
Querying Shapes of Histories
We present a shape definition language, called SDC, for retrieving objects based on shapes contained in the histories associated with these objects. It is a small, yet powerful, l...
Rakesh Agrawal, Giuseppe Psaila, Edward L. Wimmers...
ACSD
2010
IEEE
224views Hardware» more  ACSD 2010»
13 years 7 months ago
Robustness of Sequential Circuits
Digital components play a central role in the design of complex embedded systems. These components are interconnected with other, possibly analog, devices and the physical environm...
Laurent Doyen, Thomas A. Henzinger, Axel Legay, De...