6020 search results - page 5 / 1204 » A New Approach to Model Counting |
101
click to vote
PKC
2001
Springer
15 years 4 months ago
2001
Springer
Quite recently, in [4], a new time-memory tradeoff algorithm was presented. The original goal of this algorithm was to count the number of points on an elliptic curve, however, th...
131
Voted
CORR
2011
Springer
14 years 6 months ago
2011
Springer
Abstract— In this paper, we propose a novel, effective and efficient probabilistic pruning criterion for probabilistic similarity queries on uncertain data. Our approach support...
106
click to vote
CSDA
2008
14 years 11 months ago
2008
In this paper we present the results of a simulation study to explore the ability of Bayesian parametric and nonparametric models to provide an adequate fit to count data, of the t...
101
click to vote
PARLE
1991
15 years 3 months ago
1991
It is shown that the terminationdetection problem for distributed computations can be modeled as an instance of the garbage collection problem. Consequently, algorithms for the te...
111
click to vote
ACL
2009
14 years 9 months ago
2009
Kneser-Ney (1995) smoothing and its variants are generally recognized as having the best perplexity of any known method for estimating N-gram language models. Kneser-Ney smoothing...