3898 search results - page 348 / 780 » On the Bit Extraction Problem |
157
click to vote
ALENEX
2009
15 years 5 months ago
2009
Minimal perfect hash functions have been shown to be useful to compress data in several data management tasks. In particular, order-preserving minimal perfect hash functions [10] ...
145
click to vote
GECCO
2008
Springer
15 years 5 months ago
2008
Springer
We investigate the effects of precision on the efficiency of various local search algorithms on 1-D unimodal functions. We present a (1 + 1)-EA with adaptive step size which fin...
152
click to vote
ALGORITHMICA
2007
15 years 4 months ago
2007
Abstract Many compiler optimization techniques depend on the ability to calculate the number of elements that satisfy certain conditions. If these conditions can be represented by ...
133
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
Abstract--We consider the problem of communicating information over a network secretly and reliably in the presence of a hidden adversary who can eavesdrop and inject malicious err...
140
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
We give a simple polynomial-time algorithm to exactly count the number of Euler Tours (ETs) of any Eulerian generalized series-parallel graph, and show how to adapt this algorithm...