35 search results - page 4 / 7 » Pseudorandomness for Approximate Counting and Sampling |
97
Voted
CORR
2010
Springer
14 years 11 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...
AMT
2006
Springer
15 years 1 months ago
2006
Springer
As the first stage for discovering association rules, frequent itemsets mining is an important challenging task for large databases. Sampling provides an efficient way to get appro...
INFOCOM
2010
IEEE
14 years 9 months ago
2010
IEEE
On today's high-speed backbone network links, measuring per-flow traffic information has become very challenging. Maintaining exact per-flow packet counters on OC-192 or OC-76...
STOC
1997
ACM
15 years 3 months ago
1997
ACM
For a large class of examples arising in statistical physics known as attractive spin systems (e.g., the Ising model), one seeks to sample from a probability distribution π on an...
92
Voted
INFOCOM
2006
IEEE
15 years 5 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...