376 search results - page 9 / 76 » Approximating Probability Distributions Using Small Sample S... |
111
click to vote
TOMACS
2002
14 years 11 months ago
2002
Consider the problem of estimating the small probability that the maximum of a random walk exceeds a large threshold, when the process has a negative drift and the underlying rand...
101
click to vote
ICPR
2008
IEEE
16 years 28 days ago
2008
IEEE
In kernel density estimation methods, an approximation of the data probability density function is achieved by locating a kernel function at each data location. The smoothness of ...
WWW
2005
ACM
16 years 12 days ago
2005
ACM
We consider the problem of efficiently sampling Web search engine query results. In turn, using a small random sample instead of the full set of results leads to efficient approxi...
CDC
2009
IEEE
15 years 4 months ago
2009
IEEE
— Multi-agent coordination problems can be cast as distributed optimization tasks. Probability Collectives (PCs) are techniques that deal with such problems in discrete and conti...
ICCS
2004
Springer
15 years 5 months ago
2004
Springer
Shadow Hybrid Monte Carlo (SHMC) is a new method for sampling the phase space of large biological molecules. It improves sampling by allowing larger time steps and system sizes in ...