Sciweavers

7 search results - page 1 / 2
» Fast construction of nets in low dimensional metrics, and th...
Sort
View
COMPGEOM
2005
ACM
13 years 6 months ago
Fast construction of nets in low dimensional metrics, and their applications
We present a near linear time algorithm for constructing hierarchical nets in finite metric spaces with constant doubling dimension. This data-structure is then applied to obtain...
Sariel Har-Peled, Manor Mendel
ICML
2009
IEEE
14 years 5 months ago
Geometry-aware metric learning
In this paper, we introduce a generic framework for semi-supervised kernel learning. Given pairwise (dis-)similarity constraints, we learn a kernel matrix over the data that respe...
Zhengdong Lu, Prateek Jain, Inderjit S. Dhillon
JEA
2008
112views more  JEA 2008»
13 years 4 months ago
Dynamic spatial approximation trees
The Spatial Approximation Tree (sa-tree) is a recently proposed data structure for searching in metric spaces. It has been shown that it compares favorably against alternative data...
Gonzalo Navarro, Nora Reyes
CIKM
2008
Springer
13 years 6 months ago
Learning the distance metric in a personal ontology
Personal ontology construction is the task of sorting through relevant materials, identifying the main topics and concepts, and organizing them to suit personal needs. Automatic c...
Hui Yang, Jamie Callan
TON
2008
126views more  TON 2008»
13 years 4 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