1578 search results - page 23 / 316 » Algorithmic randomness of continuous functions |
COCOON
2005
Springer
14 years 4 months ago
2005
Springer
Abstract. The worst-case complexity of an implementation of Quicksort depends on the random number generator that is used to select the pivot elements. In this paper we estimate th...
STACS
2012
Springer
12 years 6 months ago
2012
Springer
The Denjoy-Young-Saks Theorem from classical analysis states that for an arbitrary function f : R → R, the Denjoy alternative holds outside a null set, i.e., for almost every re...
CGF
1999
13 years 10 months ago
1999
This paper presents a single-pass, view-dependent method to solve the rendering equation, using a stochastic iterational scheme where the transport operator is selected randomly i...
IJCAI
2003
14 years 9 days ago
2003
We describe algorithms for computing Nash equilibria in structured game representations, including both graphical games and multi-agent influence diagrams (MAIDs). The algorithms...
ICPR
2004
IEEE
15 years 1 days ago
2004
IEEE
In this paper, a region-based spatio-temporal Markov random field (STMRF) model is proposed to segment moving objects semantically. The STMRF model combines segmentation results o...