Sciweavers

50 search results - page 2 / 10
» Exact Sampling and Approximate Counting Techniques
Sort
View
SAT
2005
Springer
145views Hardware» more  SAT 2005»
13 years 11 months ago
A New Approach to Model Counting
We introduce ApproxCount, an algorithm that approximates the number of satisfying assignments or models of a formula in propositional logic. Many AI tasks, such as calculating degr...
Wei Wei, Bart Selman
INFOCOM
2010
IEEE
13 years 3 months ago
High-Speed Per-Flow Traffic Measurement with Probabilistic Multiplicity Counting
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...
Peter Lieven, Björn Scheuermann
ICDE
2004
IEEE
140views Database» more  ICDE 2004»
14 years 6 months ago
Approximate Aggregation Techniques for Sensor Databases
In the emerging area of sensor-based systems, a significant challenge is to develop scalable, fault-tolerant methods to extract useful information from the data the sensors collec...
Jeffrey Considine, Feifei Li, George Kollios, John...
STOC
2003
ACM
164views Algorithms» more  STOC 2003»
14 years 5 months ago
Approximate counting by dynamic programming
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...
Martin E. Dyer
INTERSPEECH
2010
13 years 8 days ago
Asymptotically exact noise-corrupted speech likelihoods
Model compensation techniques for noise-robust speech recognition approximate the corrupted speech distribution. This paper introduces a sampling method that, given speech and noi...
Rogier C. van Dalen, Mark J. F. Gales