337 search results - page 30 / 68 » Matching Algorithms Are Fast in Sparse Random Graphs |
ICIP
2010
IEEE
13 years 5 months ago
2010
IEEE
Motion estimation is known to be a non-convex optimization problem. This non-convexity comes from several ambiguities in motion estimation such as the aperture problem, or fast mo...
SODA
1998
ACM
13 years 9 months ago
1998
ACM
We introduce a new set of probabilistic analysis tools based on the analysis of And-Or trees with random inputs. These tools provide a unifying, intuitive, and powerful framework ...
ICDM
2008
IEEE
14 years 2 months ago
2008
IEEE
This paper studies how to incorporate side information (such as users’ feedback) in measuring node proximity on large graphs. Our method (ProSIN) is motivated by the well-studie...
TSP
2011
13 years 2 months ago
2011
Abstract—We introduce an extended family of continuous-domain stochastic models for sparse, piecewise-smooth signals. These are specified as solutions of stochastic differential...
APPROX
2009
Springer
14 years 2 months ago
2009
Springer
We explore the average-case “Vickrey” cost of structures in a random setting: the Vickrey cost of a shortest path in a complete graph or digraph with random edge weights; the V...