6393 search results - page 1111 / 1279 » Randomized Algorithms on the Mesh |
134
click to vote
CIKM
2009
Springer
15 years 10 months ago
2009
Springer
We consider the coverage testing problem where we are given a document and a corpus with a limited query interface and asked to find if the corpus contains a near-duplicate of th...
128
click to vote
COCO
2009
Springer
15 years 10 months ago
2009
Springer
We study the task of randomness extraction from sources which are distributed uniformly on an unknown algebraic variety. In other words, we are interested in constructing a functi...
135
click to vote
COCO
2009
Springer
15 years 10 months ago
2009
Springer
—We study the one-way number-on-the-forhead (NOF) communication complexity of the k-layer pointer jumping problem. Strong lower bounds for this problem would have important impli...
125
click to vote
CPM
2009
Springer
15 years 10 months ago
2009
Springer
The NP-hard Interval Constrained Coloring problem appears in the interpretation of experimental data in biochemistry dealing with protein fragments. Given a set of m integer interv...
133
click to vote
GECCO
2009
Springer
15 years 10 months ago
2009
Springer
A genome rearrangement scenario describes a series of chromosome fusion, fission, and translocation operations that suffice to rewrite one genome into another. Exact algorithmic ...