557 search results - page 81 / 112 » Visualizing Weighted Edges in Graphs |
133
click to vote
CVPR
2010
IEEE
14 years 9 months ago
2010
IEEE
We investigate how to discover all common visual patterns within two sets of feature points. Common visual patterns generally share similar local features as well as similar spati...
101
Voted
COMPGEOM
2010
ACM
15 years 4 months ago
2010
ACM
Let D be a weighted directed graph cellularly embedded in a surface of genus g, orientable or not, possibly with boundary. We describe algorithms to compute a shortest non-contrac...
103
click to vote
CVPR
2008
IEEE
16 years 1 months ago
2008
IEEE
We consider the problem of finding a matching between two sets of features, given complex relations among them, going beyond pairwise. Each feature set is modeled by a hypergraph ...
100
click to vote
FOCS
2006
IEEE
15 years 5 months ago
2006
IEEE
An additive spanner of an unweighted undirected graph G with distortion d is a subgraph H such that for any two vertices u, v ∈ G, we have δH(u, v) ≤ δG(u, v) + d. For every...
75
Voted
FOCS
2004
IEEE
15 years 2 months ago
2004
IEEE
The Metric Labeling problem is an elegant and powerful mathematical model capturing a wide range of classification problems. The input to the problem consists of a set of labels a...