7228 search results - page 60 / 1446 » From Algorithmic to Subjective Randomness |
105
click to vote
CORR
2008
Springer
14 years 9 months ago
2008
Springer
A decentralized search algorithm is a method of routing on a random graph that uses only limited, local, information about the realization of the graph. In some random graph model...
COCO
1994
Springer
15 years 1 months ago
1994
Springer
Resource-bounded measure as originated by Lutz is an extension of classical measure theory which provides a probabilistic means of describing the relative sizes of complexity clas...
176
click to vote
ICDT
2009
ACM
15 years 10 months ago
2009
ACM
We continue the study of approximating the number of distinct elements in a data stream of length n to within a (1? ) factor. It is known that if the stream may consist of arbitra...
TIP
1998
14 years 9 months ago
1998
Abstract— Our noncausal, nonparametric, multiscale, Markov random field (MRF) model is capable of synthesising and capturing the characteristics of a wide variety of textures, f...
KDD
2003
ACM
15 years 10 months ago
2003
ACM
Privacy is an important issue in data mining and knowledge discovery. In this paper, we propose to use the randomized response techniques to conduct the data mining computation. S...