376 search results - page 9 / 76 » Approximating Probability Distributions Using Small Sample S... |
TOMACS
2002
13 years 7 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...
ICPR
2008
IEEE
14 years 8 months 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
14 years 8 months 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
14 years 11 days 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
14 years 1 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 ...