Sciweavers

5580 search results - page 946 / 1116
» Randomized priority algorithms
Sort
View
COCO
2009
Springer
98views Algorithms» more  COCO 2009»
14 years 3 months ago
Extractors for Varieties
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...
Zeev Dvir
COCO
2009
Springer
124views Algorithms» more  COCO 2009»
14 years 3 months ago
The Maximum Communication Complexity of Multi-Party Pointer Jumping
—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...
Joshua Brody
CPM
2009
Springer
127views Combinatorics» more  CPM 2009»
14 years 3 months ago
Deconstructing Intractability: A Case Study for Interval Constrained Coloring
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...
Christian Komusiewicz, Rolf Niedermeier, Johannes ...
GECCO
2009
Springer
107views Optimization» more  GECCO 2009»
14 years 3 months ago
Swarming along the evolutionary branches sheds light on genome rearrangement scenarios
A genome rearrangement scenario describes a series of chromosome fusion, fission, and translocation operations that suffice to rewrite one genome into another. Exact algorithmic ...
Nikolay Vyahhi, Adrien Goëffon, Macha Nikolsk...
ICB
2009
Springer
137views Biometrics» more  ICB 2009»
14 years 3 months ago
Direct Pore Matching for Fingerprint Recognition
Abstract. Sweat pores on fingerprints have proven to be useful features for personal identification. Several methods have been proposed for pore matching. The state-of-the-art meth...
Qijun Zhao, Lei Zhang, David Zhang, Nan Luo