Sciweavers

56 search results - page 9 / 12
» On lovely pairs of geometric structures
Sort
View
TON
2008
126views more  TON 2008»
13 years 9 months ago
Hyperbolic embedding of internet graph for distance estimation and overlay construction
Estimating distances in the Internet has been studied in the recent years due to its ability to improve the performance of many applications, e.g., in the peer-topeer realm. One sc...
Yuval Shavitt, Tomer Tankel
CVPR
2003
IEEE
14 years 11 months ago
Clustering Appearances of Objects Under Varying Illumination Conditions
We introduce two appearance-based methods for clustering a set of images of 3-D objects, acquired under varying illumination conditions, into disjoint subsets corresponding to ind...
Jeffrey Ho, Ming-Hsuan Yang, Jongwoo Lim, Kuang-Ch...
CVPR
2005
IEEE
14 years 11 months ago
Correspondence Expansion for Wide Baseline Stereo
We present a new method for generating large numbers of accurate point correspondences between two wide baseline images. This is important for structure-from-motion algorithms, wh...
Kevin L. Steele, Parris K. Egbert
CW
2002
IEEE
14 years 2 months ago
Topological Morphing Using Reeb Graphs
Metamorphosis between 3D objects is often the transformation between a pair of shapes that have the same topology. This paper presents a new model using Reeb graphs and their cont...
Pizzanu Kanonchayos, Tomoyuki Nishita, Yoshihisa S...
FOCS
1999
IEEE
14 years 2 months ago
Approximate Nearest Neighbor Algorithms for Hausdorff Metrics via Embeddings
Hausdorff metrics are used in geometric settings for measuring the distance between sets of points. They have been used extensively in areas such as computer vision, pattern recog...
Martin Farach-Colton, Piotr Indyk