70 search results - page 10 / 14 » Distance Labeling in Hyperbolic Graphs |
144
click to vote
SSPR
2004
Springer
15 years 10 months ago
2004
Springer
We present a probabilistic graphical model for point set matching. By using a result about the redundancy of the pairwise distances in a point set, we represent the binary relation...
146
Voted
SPAA
2005
ACM
15 years 10 months ago
2005
ACM
A weighted undirected network is ∆ growth-bounded if the number of nodes at distance 2r around any given node is at most ∆ times the number of nodes at distance r around the n...
179
click to vote
CVPR
2008
IEEE
16 years 7 months ago
2008
IEEE
We present a new shape prior segmentation method using graph cuts capable of segmenting multiple objects. The shape prior energy is based on a shape distance popular with level se...
160
click to vote
ECCV
2004
Springer
16 years 6 months ago
2004
Springer
In recent work, we presented a framework for many-to-many matching of multi-scale feature hierarchies, in which features and their relations were captured in a vertex-labeled, edge...
120
click to vote
DAM
2008
15 years 5 months ago
2008
The NP-complete Closest 4-Leaf Power problem asks, given an undirected graph, whether it can be modified by at most r edge insertions or deletions such that it becomes a 4-leaf po...