4302 search results - page 443 / 861 » Index Pairs Algorithms |
156
click to vote
GD
2008
Springer
15 years 7 months ago
2008
Springer
We describe an efficient method for drawing any n-vertex simple graph G in the hyperbolic plane. Our algorithm produces greedy drawings, which support greedy geometric routing, so...
183
Voted
CGF
2008
15 years 6 months ago
2008
We present an unsupervised algorithm for aligning a pair of shapes in the presence of significant articulated motion and missing data, while assuming no knowledge of a template, u...
193
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Abstract. In this paper, we consider the problem of representing graphs by triangles whose sides touch. We present linear time algorithms for creating touching triangles representa...
170
click to vote
SIGMETRICS
2008
ACM
15 years 6 months ago
2008
ACM
This paper describes an efficient and accurate approach to estimate the network distance between arbitrary Internet hosts. We use three landmark hosts forming a triangle in two-di...
168
click to vote
IPL
2002
15 years 6 months ago
2002
Restricted rotation distance between pairs of rooted binary trees measures differences in tree shape and is related to rotation distance. In restricted rotation distance, the rota...