1541 search results - page 22 / 309 » Analysis of Random Noise and Random Walk Algorithms |
AAAI
2008
13 years 11 months ago
2008
In this paper, we present a general data clustering algorithm which is based on the asymmetric pairwise measure of Markov random walk hitting time on directed graphs. Unlike tradi...
SODA
2003
ACM
13 years 10 months ago
2003
ACM
We study the cover time of a random walk on graphs G ∈ Gn,p when p = c log n
SIGIR
2008
ACM
13 years 9 months ago
2008
ACM
We introduce a novel approach to expert finding based on multi-step relevance propagation from documents to related candidates. Relevance propagation is modeled with an absorbing ...
CN
1999
13 years 8 months ago
1999
Recent researchhas studied howto measurethe size of a searchengine, in terms of the number of pages indexed. In this paper, we consider a di erent measure for search engines, name...
ICASSP
2010
IEEE
13 years 9 months ago
2010
IEEE
We propose an algorithm for detecting bridges and estimating geodesic distances from a set of noisy samples of an underlying manifold. Finding geodesics on a nearest neighbors gra...