Sciweavers

44 search results - page 5 / 9
» Improvement on Ha-Moon Randomized Exponentiation Algorithm
Sort
View
AAAI
1996
13 years 7 months ago
Improved Limited Discrepancy Search
We present an improvement to Harvey and Ginsberg's limited discrepancy search algorithm, which eliminates much of the redundancy in the original, by generating each path from...
Richard E. Korf
DCC
2005
IEEE
14 years 5 months ago
A Point-Set Compression Heuristic for Fiber-Based Certificates of Authenticity
A certificate of authenticity (COA) is an inexpensive physical object that has a random unique structure with high cost of near-exact reproduction. An additional requirement is th...
Darko Kirovski
WALCOM
2010
IEEE
290views Algorithms» more  WALCOM 2010»
14 years 22 days ago
The Covert Set-Cover Problem with Application to Network Discovery
We address a version of the set-cover problem where we do not know the sets initially (and hence referred to as covert) but we can query an element to find out which sets contain ...
Sandeep Sen, V. N. Muralidhara
CORR
2010
Springer
66views Education» more  CORR 2010»
13 years 5 months ago
On Extractors and Exposure-Resilient Functions for Sublogarithmic Entropy
We study deterministic extractors for bit-fixing sources (a.k.a. resilient functions) and exposure-resilient functions for small min-entropy. That is, of the n bits given as input...
Yakir Reshef, Salil P. Vadhan
CORR
2011
Springer
143views Education» more  CORR 2011»
12 years 9 months ago
Towards Understanding and Harnessing the Potential of Clause Learning
Efficient implementations of DPLL with the addition of clause learning are the fastest complete Boolean satisfiability solvers and can handle many significant real-world problem...
Paul Beame, Henry A. Kautz, Ashish Sabharwal