1554 search results - page 224 / 311 » Parameterized Complexity and Approximation Algorithms |
107
Voted
COCO
2004
Springer
15 years 8 months ago
2004
Springer
This paper develops new relationships between resource-bounded dimension, entropy rates, and compression. New tools for calculating dimensions are given and used to improve previo...
136
Voted
ALGORITHMICA
2000
15 years 2 months ago
2000
We study the problem of minimizing the expected cost of binary searching for data where the access cost is not fixed and depends on the last accessed element, such as data stored i...
111
Voted
CC
2007
Springer
15 years 2 months ago
2007
Springer
We prove that if NP ⊆ BPP, i.e., if SAT is worst-case hard, then for every probabilistic polynomial-time algorithm trying to decide SAT, there exists some polynomially samplable ...
179
Voted
COMPGEOM
2011
ACM
14 years 6 months ago
2011
ACM
We present a clustering scheme that combines a mode-seeking phase with a cluster merging phase in the corresponding density map. While mode detection is done by a standard graph-b...
216
Voted
ICDE
2005
IEEE
16 years 4 months ago
2005
IEEE
Efficient one-pass computation of F0, the number of distinct elements in a data stream, is a fundamental problem arising in various contexts in databases and networking. We consid...