50 search results - page 1 / 10 » Exact Sampling and Approximate Counting Techniques |
STOC
1998
ACM
15 years 2 months ago
1998
ACM
88
Voted
CORR
2010
Springer
14 years 10 months ago
2010
Springer
We give a simple polynomial-time algorithm to exactly count the number of Euler Tours (ETs) of any Eulerian generalized series-parallel graph, and show how to adapt this algorithm...
110
Voted
COMPGEOM
2004
ACM
15 years 3 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...
77
Voted
INFOCOM
2006
IEEE
15 years 4 months ago
2006
IEEE
— Monitoring the traffic in high-speed networks is a data intensive problem. Uniform packet sampling is the most popular technique for reducing the amount of data the network mo...
EMNLP
2011
13 years 10 months ago
2011
We exploit sketch techniques, especially the Count-Min sketch, a memory, and time efficient framework which approximates the frequency of a word pair in the corpus without explic...