98 search results - page 4 / 20 » Approximate counting in bounded arithmetic |
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...
COMPGEOM
2009
ACM
14 years 1 months ago
2009
ACM
We present cache-oblivious solutions to two important variants of range searching: range reporting and approximate range counting. Our main contribution is a general approach for ...
ITA
2007
13 years 7 months ago
2007
We explicit the link between the computer arithmetic problem of providing correctly rounded algebraic functions and some diophantine approximation issues. This allows to get bounds...
AAAI
2007
13 years 9 months ago
2007
We present a new estimator for counting the number of solutions of a Boolean satisfiability problem as a part of an importance sampling framework. The estimator uses the recently...
CP
2008
Springer
13 years 9 months ago
2008
Springer
In this paper, we describe a new algorithm for sampling solutions from a uniform distribution over the solutions of a constraint network. Our new algorithm improves upon the Sampli...