Sciweavers

1282 search results - page 164 / 257
» Practical Loss-Resilient Codes
Sort
View
ICFP
2009
ACM
16 years 1 months ago
Purely functional lazy non-deterministic programming
Functional logic programming and probabilistic programming have demonstrated the broad benefits of combining laziness (non-strict evaluation with sharing of the results) with non-...
Sebastian Fischer, Oleg Kiselyov, Chung-chieh Shan
173
Voted
POPL
2001
ACM
16 years 1 months ago
Avoiding exponential explosion: generating compact verification conditions
Current verification condition (VC) generation algorithms, such as weakest preconditions, yield a VC whose size may be exponential in the size of the code fragment being checked. ...
Cormac Flanagan, James B. Saxe
DCC
2008
IEEE
16 years 8 days ago
Sublinear Recovery of Sparse Wavelet Signals
There are two main classes of decoding algorithms for "compressed sensing," those which run time time polynomial in the signal length and those which use sublinear resou...
Ray Maleh, Anna C. Gilbert
88
Voted
DCC
2007
IEEE
16 years 8 days ago
A Simple Statistical Algorithm for Biological Sequence Compression
This paper introduces a novel algorithm for biological sequence compression that makes use of both statistical properties and repetition within sequences. A panel of experts is ma...
Minh Duc Cao, Trevor I. Dix, Lloyd Allison, Chris ...
90
Voted
ICCAD
2005
IEEE
121views Hardware» more  ICCAD 2005»
15 years 9 months ago
Transition-by-transition FSM traversal for reachability analysis in bounded model checking
Abstract— In bounded model checking (BMC)-based verification flows lack of reachability constraints often leads to false negatives. At present, it is daily practice of a veri...
Minh D. Nguyen, Dominik Stoffel, Markus Wedler, Wo...