767 search results - page 57 / 154 » On Clustering Using Random Walks |
255
Voted
SIGMETRICS
2008
ACM
15 years 7 months ago
2008
ACM
In this paper, we consider hybrid peer-to-peer systems where users form an unstructured peer-to-peer network with the purpose of assisting a server in the distribution of data. We...
196
Voted
ICALP
2004
Springer
16 years 16 days ago
2004
Springer
We study the random composition of a small family of O(n3 ) simple permutations on {0, 1}n . Specifically we ask what is the number of compositions needed to achieve a permutatio...
169
click to vote
CVPR
2008
IEEE
16 years 9 months ago
2008
IEEE
In this paper, we present a novel approach to contentsbased image retrieval. The method hinges in the use of quasi-random sampling to retrieve those images in a database which are...
211
click to vote
CVPR
2011
IEEE
14 years 11 months ago
2011
IEEE
We propose a new objective function for superpixel segmentation. This objective function consists of two components: entropy rate of a random walk on a graph and a balancing term....
211
click to vote
TOMACS
2002
15 years 6 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...