197 search results - page 2 / 40 » Simple deterministic approximation algorithms for counting m... |
CORR
2011
Springer
13 years 2 months ago
2011
Springer
Countless variants of the Lempel-Ziv compression are widely used in many real-life applications. This paper is concerned with a natural modification of the classical pattern match...
PODS
2004
ACM
14 years 7 months ago
2004
ACM
We consider the problem of maintaining approximate counts and quantiles over fixed- and variablesize sliding windows in limited space. For quantiles, we present deterministic algo...
STOC
2003
ACM
14 years 8 months ago
2003
ACM
We give efficient algorithms to sample uniformly, and count approximately, the solutions to a zero-one knapsack problem. The algorithm is based on using dynamic programming to pro...
COLING
2010
13 years 2 months ago
2010
This paper presents a simple and efficient algorithm for approximate dictionary matching designed for similarity measures such as cosine, Dice, Jaccard, and overlap coefficients. ...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
We present a local algorithm (constant-time distributed algorithm) for finding a 3-approximate vertex cover in bounded-degree graphs. The algorithm is deterministic, and no auxili...