Sciweavers

314 search results - page 58 / 63
» Arithmetic Coding Revisited
Sort
View
TON
2002
175views more  TON 2002»
13 years 7 months ago
Compressed bloom filters
A Bloom filter is a simple space-efficient randomized data structure for representing a set in order to support membership queries. Although Bloom filters allow false positives, f...
Michael Mitzenmacher
FOCM
2010
108views more  FOCM 2010»
13 years 6 months ago
Parallelization Method for a Continuous Property
Abstract. An automated method of general purpose is introduced for computing a rigorous estimate of a bounded region in Rn whose points satisfy a given property. The method is base...
Pawel Pilarczyk
SAT
2010
Springer
174views Hardware» more  SAT 2010»
13 years 5 months ago
A System for Solving Constraint Satisfaction Problems with SMT
Abstract. SAT Modulo Theories (SMT) consists of deciding the satisfiability of a formula with respect to a decidable background theory, such as linear integer arithmetic, bit-vect...
Miquel Bofill, Josep Suy, Mateu Villaret
CORR
2011
Springer
172views Education» more  CORR 2011»
13 years 2 months ago
Improving Strategies via SMT Solving
We consider the problem of computing numerical invariants of programs by abstract interpretation. Our method eschews two traditional sources of imprecision: (i) the use of widenin...
Thomas Martin Gawlitza, David Monniaux
GLVLSI
2007
IEEE
141views VLSI» more  GLVLSI 2007»
14 years 1 months ago
Transition-activity aware design of reduction-stages for parallel multipliers
We propose an interconnect reorganization algorithm for reduction stages in parallel multipliers. It aims at minimizing power consumption for given static probabilities at the pri...
Saeeid Tahmasbi Oskuii, Per Gunnar Kjeldsberg, Osc...