85 search results - page 1 / 17 » Generalized approximate counting revisited |
TCS
2008
13 years 5 months ago
2008
A large class of q-distributions is defined on the stochastic model of Bernoulli trials in which the probability of success (=advancing to the next level) depends geometrically on...
COMPGEOM
2009
ACM
14 years 2 hour 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 ...
ICML
2004
IEEE
14 years 6 months ago
2004
IEEE
The multiple-instance learning (MIL) model has been very successful in application areas such as drug discovery and content-based imageretrieval. Recently, a generalization of thi...
TNN
2010
13 years 5 days ago
2010
Compared to Singular Value Decomposition (SVD), Generalized Low Rank Approximations of Matrices (GLRAM) can consume less computation time, obtain higher compression ratio, and yiel...
CORR
2010
Springer
13 years 5 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...