118 search results - page 15 / 24 » A phase transition in the random transposition random walk |
155
click to vote
BMVC
2001
15 years 9 months ago
2001
This paper describes a spectral method for graph-matching. We adopt a graphical models viewpoint in which the graph adjacency matrix is taken to represent the transition probabili...
206
click to vote
NIPS
2004
15 years 8 months ago
2004
We show how to build hierarchical, reduced-rank representation for large stochastic matrices and use this representation to design an efficient algorithm for computing the largest...
159
click to vote
CPAIOR
2007
Springer
16 years 26 days ago
2007
Springer
Abstract. This work presents methods for processing a constraint satisfaction problem (CSP) formulated by an expression-based language, before the CSP is presented to a stochastic ...
117
click to vote
SIGCOMM
1993
ACM
15 years 10 months ago
1993
ACM
The paper considers a network with many apparently-independent periodic processes and discusses one method by which these processes can inadvertently become synchronized. In parti...
159
click to vote
ICAI
2003
15 years 8 months ago
2003
Boolean satisfiability (SAT) is the canonical NP-complete problem that plays an important role in AI and has many practical applications in Computer Science in general. Boolean n...