197 search results - page 1 / 40 » Simple deterministic approximation algorithms for counting m... |
94
Voted
STOC
2007
ACM
16 years 1 months ago
2007
ACM
120
click to vote
STOC
1998
ACM
15 years 5 months ago
1998
ACM
We present a deterministic strongly polynomial algorithm that computes the permanent of a nonnegative n × n matrix to within a multiplicative factor of en. To this end we develop...
139
click to vote
PODS
2012
ACM
13 years 3 months ago
2012
ACM
We show that randomization can lead to significant improvements for a few fundamental problems in distributed tracking. Our basis is the count-tracking problem, where there are k...
129
click to vote
COMPGEOM
2004
ACM
15 years 6 months ago
2004
ACM
We present memory-efficient deterministic algorithms for constructing -nets and -approximations of streams of geometric data. Unlike probabilistic approaches, these deterministic...
110
click to vote
IPL
2007
15 years 1 months ago
2007
We present a simple and fast deterministic solution to the string matching with don’t cares problem. The task is to determine all positions in a text where a pattern occurs, all...