779 search results - page 49 / 156 » Algorithms for the Sample Mean of Graphs |
172
click to vote
ICASSP
2010
IEEE
15 years 4 months ago
2010
IEEE
We propose an algorithm for detecting bridges and estimating geodesic distances from a set of noisy samples of an underlying manifold. Finding geodesics on a nearest neighbors gra...
140
click to vote
NIPS
2004
15 years 5 months ago
2004
Most existing tracking algorithms construct a representation of a target object prior to the tracking task starts, and utilize invariant features to handle appearance variation of...
153
click to vote
ALGORITHMICA
2008
15 years 4 months ago
2008
Given a graph with edges colored Red and Blue, we wish to sample and approximately count the number of perfect matchings with exactly k Red edges. We study a Markov chain on the sp...
138
click to vote
STOC
2006
ACM
16 years 4 months ago
2006
ACM
A common thread in all the recent results concerning the testing of dense graphs is the use of Szemer?edi's regularity lemma. In this paper we show that in some sense this is...
157
click to vote
ICCV
2009
IEEE
16 years 9 months ago
2009
IEEE
In this work, we extend a common framework for seeded
image segmentation that includes the graph cuts, ran-
dom walker, and shortest path optimization algorithms.
Viewing an ima...