7228 search results - page 31 / 1446 » From Algorithmic to Subjective Randomness |
CN
2007
14 years 9 months ago
2007
In this paper we develop a model for random walk-based search mechanisms in unstructured P2P networks. This model is used to obtain analytical expressions for the performance metr...
80
Voted
DCG
2008
14 years 9 months ago
2008
Recently there has been a lot of interest in geometrically motivated approaches to data analysis in high dimensional spaces. We consider the case where data is drawn from sampling...
COMPGEOM
2003
ACM
15 years 2 months ago
2003
ACM
Randomized incremental constructions are widely used in computational geometry, but they perform very badly on large data because of their inherently random memory access patterns...
COCOON
2005
Springer
15 years 3 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...
COLT
2005
Springer
15 years 3 months ago
2005
Springer
We consider a natural framework of learning from correlated data, in which successive examples used for learning are generated according to a random walk over the space of possibl...