Sciweavers

253 search results - page 12 / 51
» Random Walks with Look-Ahead in Scale-Free Random Graphs
Sort
View
ML
2010
ACM
141views Machine Learning» more  ML 2010»
13 years 7 months ago
Relational retrieval using a combination of path-constrained random walks
Scientific literature with rich metadata can be represented as a labeled directed graph. This graph representation enables a number of scientific tasks such as ad hoc retrieval o...
Ni Lao, William W. Cohen
FSTTCS
2001
Springer
14 years 1 months ago
On Clustering Using Random Walks
Abstract. We propose a novel approach to clustering, based on deterministic analysis of random walks on the weighted graph associated with the clustering problem. The method is cen...
David Harel, Yehuda Koren
STOC
1992
ACM
100views Algorithms» more  STOC 1992»
14 years 18 days ago
Biased Random Walks
How much can an imperfect source of randomness affect an algorithm? We examine several simple questions of this type concerning the long-term behavior of a random walk on a finite...
Yossi Azar, Andrei Z. Broder, Anna R. Karlin, Nath...
PAMI
2006
440views more  PAMI 2006»
13 years 8 months ago
Random Walks for Image Segmentation
Abstract-- A novel method is proposed for performing multilabel, interactive image segmentation. Given a small number of pixels with user-defined (or pre-defined) labels, one can a...
Leo Grady
CORR
2002
Springer
113views Education» more  CORR 2002»
13 years 8 months ago
Generic-case complexity, decision problems in group theory and random walks
We give a precise definition of "generic-case complexity" and show that for a very large class of finitely generated groups the classical decision problems of group theor...
Ilya Kapovich, Alexei G. Myasnikov, Paul Schupp, V...