1578 search results - page 16 / 316 » Algorithmic randomness of continuous functions |
Book
"From an applications viewpoint, the main reason to study the subject of these notes is to help deal with the complexity of describing random, time-varying functions. A random...
WSC
1997
14 years 7 days ago
1997
In this paper we compare the average performance of Monte Carlo methods for global optimization with non-adaptive deterministic alternatives. We analyze the behavior of the algori...
COCO
1994
Springer
14 years 3 months ago
1994
Springer
A probabilistically checkable debate system (PCDS) for a language L consists of a probabilisticpolynomial-time veri er V and a debate between Player 1, who claims that the input x ...
FOCS
2006
IEEE
14 years 5 months ago
2006
IEEE
We prove that the hit-and-run random walk is rapidly mixing for an arbitrary logconcave distribution starting from any point in the support. This extends the work of [26], where t...
SIAMIS
2010
13 years 5 months ago
2010
Markov random field (MRF) models, including conditional random field models, are popular in computer vision. However, in order to be computationally tractable, they are limited to ...