Sciweavers

366 search results - page 56 / 74
» fast 2011
Sort
View
CAV
2011
Springer
234views Hardware» more  CAV 2011»
14 years 1 months ago
Resolution Proofs and Skolem Functions in QBF Evaluation and Applications
Abstract. Quantified Boolean formulae (QBF) allow compact encoding of many decision problems. Their importance motivated the development of fast QBF solvers. Certifying the result...
Valeriy Balabanov, Jie-Hong R. Jiang
CGO
2011
IEEE
14 years 1 months ago
Practical memory checking with Dr. Memory
—Memory corruption, reading uninitialized memory, using freed memory, and other memory-related errors are among the most difficult programming bugs to identify and fix due to t...
Derek Bruening, Qin Zhao
CJ
2011
14 years 1 months ago
Dynamic Multipath Allocation in Ad Hoc Networks
Ad Hoc networks are characterized by fast dynamic changes in the topology of the network. A known technique to improve QoS is to use Multipath routing where packets (voice/video/...
Yosi Ben-Asher, Sharoni Feldman, Moran Feldman
CODCRY
2011
Springer
242views Cryptology» more  CODCRY 2011»
14 years 1 months ago
Faster 2-Regular Information-Set Decoding
Fix positive integers B and w. Let C be a linear code over F2 of length Bw. The 2-regular-decoding problem is to find a nonzero codeword consisting of w length-B blocks, each of w...
Daniel J. Bernstein, Tanja Lange, Christiane Peter...
COMPGEOM
2011
ACM
14 years 1 months ago
Compressive sensing with local geometric features
We propose a framework for compressive sensing of images with local geometric features. Specifically, let x ∈ RN be an N-pixel image, where each pixel p has value xp. The image...
Rishi Gupta, Piotr Indyk, Eric Price, Yaron Rachli...