118 search results - page 7 / 24 » A phase transition in the random transposition random walk |
COMPGEOM
2008
ACM
13 years 10 months ago
2008
ACM
We investigate the complexity of the outer face in arrangements of line segments of a fixed length in the plane, drawn uniformly at random within a square. We derive upper bounds ...
AAAI
2008
13 years 10 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...
DAM
2008
13 years 8 months ago
2008
This paper presents the axioms of a real time random walk on the set of states of a medium and some of their consequences, such as the asymptotic probabilities of the states. The ...
ICML
2006
IEEE
14 years 9 months ago
2006
IEEE
We consider the problem of clustering in its most basic form where only a local metric on the data space is given. No parametric statistical model is assumed, and the number of cl...
ICML
2004
IEEE
14 years 9 months ago
2004
IEEE
Many NLP tasks rely on accurately estimating word dependency probabilities P(w1|w2), where the words w1 and w2 have a particular relationship (such as verb-object). Because of the...