1067 search results - page 36 / 214 » Probabilistic regular graphs |
116
click to vote
COMBINATORICS
2006
15 years 2 months ago
2006
Let T be the Cayley graph of a finitely generated free group F. Given two vertices in T consider all the walks of a given length between these vertices that at a certain time must...
152
Voted
TIP
2010
15 years 28 days ago
2010
—In increasingly many cases of interest in computer vision and pattern recognition, one is often confronted with the situation where data size is very large. Usually, the labels ...
105
Voted
CDC
2008
IEEE
15 years 9 months ago
2008
IEEE
— It has been observed that adding a few long range edges to certain graph topologies can significantly increase the rate of convergence for consensus algorithms. A notable exam...
121
Voted
ICPR
2004
IEEE
16 years 3 months ago
2004
IEEE
Graph edit distance provides an error-tolerant way to measure distances between attributed graphs. The effectiveness of edit distance based graph classification algorithms relies ...
124
Voted
COMBINATORICS
2002
15 years 2 months ago
2002
We prove that the space of possible final configurations for a parking problem is parameterized by the vertices of a regular Bruhat graph associated to a 231-avoiding permutation,...