779 search results - page 37 / 156 » Algorithms for the Sample Mean of Graphs |
144
click to vote
STOC
2002
ACM
16 years 4 months ago
2002
ACM
A string graph is the intersection graph of a set of curves in the plane. Each curve is represented by a vertex, and an edge between two vertices means that the corresponding curv...
132
click to vote
ICIP
2005
IEEE
16 years 5 months ago
2005
IEEE
This paper presents a novel method for real-time tracking of objects in video sequences. Tracking is performed using the so-called Morphological Elastic Graph Matching algorithm. ...
125
click to vote
ISCC
2006
IEEE
15 years 10 months ago
2006
IEEE
Rectangular dualization is an effective, hierarchically oriented visualization method for network topologies and can be used in many other problems having in common with networks ...
125
click to vote
APPROX
2007
Springer
15 years 10 months ago
2007
Springer
Consider a scenario where one desires to simulate the execution of some graph algorithm on random input graphs of huge, perhaps even exponential size. Sampling and storing these h...
139
click to vote
CVPR
2007
IEEE
16 years 6 months ago
2007
IEEE
Many vision tasks are posed as either graph partitioning (coloring) or graph matching (correspondence) problems. The former include segmentation and grouping, and the latter inclu...