2310 search results - page 156 / 462 » Coloring Random Graphs |
122
click to vote
ICCV
2007
IEEE
16 years 4 months ago
2007
IEEE
We present a probabilistic multi-cue tracking approach constructed by employing a novel randomized template tracker and a constant color model based particle filter. Our approach ...
115
click to vote
ICPR
2006
IEEE
16 years 3 months ago
2006
IEEE
This paper exploits the properties of the commute time for the purposes of graph matching. Our starting point is the random walk on the graph, which is determined by the heat-kern...
106
click to vote
CORR
2010
Springer
15 years 2 months ago
2010
Springer
Let G = (V, E) be an undirected loopless graph with possible parallel edges and s, t V . Assume that s is labelled at the initial time step and that every labelled vertex copies i...
128
Voted
SIAMDM
2010
14 years 9 months ago
2010
We consider the problem of finding obnoxious centers in graphs. For arbitrary graphs with n vertices and m edges, we give a randomized algorithm with O(n log2 n + m log n) expecte...
121
Voted
RSA
2010
15 years 29 days ago
2010
Consider the complete n-vertex graph whose edge-lengths are independent exponentially distributed random variables. Simultaneously for each pair of vertices, put a constant flow ...