Sciweavers

344 search results - page 13 / 69
» Random Walks on Colored Graphs
Sort
View
CPC
2006
92views more  CPC 2006»
13 years 7 months ago
Waiting for a Bat to Fly By (in Polynomial Time)
We observe returns of a simple random walk on a finite graph to a fixed node, and would like to infer properties of the graph, in particular properties of the spectrum of the trans...
Itai Benjamini, Gady Kozma, László L...
RSA
2008
78views more  RSA 2008»
13 years 7 months ago
How many random edges make a dense hypergraph non-2-colorable?
: We study a model of random uniform hypergraphs, where a random instance is obtained by adding random edges to a large hypergraph of a given density. The research on this model fo...
Benny Sudakov, Jan Vondrák
STOC
1992
ACM
100views Algorithms» more  STOC 1992»
13 years 11 months 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 7 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 7 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...