Sciweavers

250 search results - page 17 / 50
» Verifying Tolerant Systems Using Polynomial Approximations
Sort
View
VALUETOOLS
2006
ACM
125views Hardware» more  VALUETOOLS 2006»
15 years 3 months ago
An approximative method for calculating performance measures of Markov processes
We present a new approximation method called value extrapolation for Markov processes with large or infinite state spaces. The method can be applied for calculating any performan...
Juha Leino, Jorma T. Virtamo
PVLDB
2008
111views more  PVLDB 2008»
14 years 9 months ago
Approximate lineage for probabilistic databases
In probabilistic databases, lineage is fundamental to both query processing and understanding the data. Current systems s.a. Trio or Mystiq use a complete approach in which the li...
Christopher Ré, Dan Suciu
NSDI
2008
14 years 11 months ago
Centered Discretization with Application to Graphical Passwords
Discretization is used in click-based graphical passwords so that approximately correct entries can be accepted by the system. We show that the existing discretization scheme of B...
Sonia Chiasson, Jayakumar Srinivasan, Robert Biddl...
ICCAD
2002
IEEE
100views Hardware» more  ICCAD 2002»
15 years 2 months ago
Optimal buffered routing path constructions for single and multiple clock domain systems
Shrinking process geometries and the increasing use of IP components in SoC designs give rise to new problems in routing and buffer insertion. A particular concern is that cross-c...
Soha Hassoun, Charles J. Alpert, Meera Thiagarajan
109
Voted
PLDI
2011
ACM
14 years 8 days ago
EnerJ: approximate data types for safe and general low-power computation
Energy is increasingly a first-order concern in computer systems. Exploiting energy-accuracy trade-offs is an attractive choice in applications that can tolerate inaccuracies. Re...
Adrian Sampson, Werner Dietl, Emily Fortuna, Danus...