Sciweavers

591 search results - page 28 / 119
» An Efficient Algorithm for Local Distance Metric Learning
Sort
View
KDD
2009
ACM
180views Data Mining» more  KDD 2009»
15 years 10 months ago
Using graph-based metrics with empirical risk minimization to speed up active learning on networked data
Active and semi-supervised learning are important techniques when labeled data are scarce. Recently a method was suggested for combining active learning with a semi-supervised lea...
Sofus A. Macskassy
CVPR
2004
IEEE
15 years 11 months ago
Fast Contour Matching Using Approximate Earth Mover's Distance
Weighted graph matching is a good way to align a pair of shapes represented by a set of descriptive local features; the set of correspondences produced by the minimum cost matchin...
Kristen Grauman, Trevor Darrell
ICML
2004
IEEE
15 years 10 months ago
Boosting margin based distance functions for clustering
The performance of graph based clustering methods critically depends on the quality of the distance function, used to compute similarities between pairs of neighboring nodes. In t...
Tomer Hertz, Aharon Bar-Hillel, Daphna Weinshall
3DIM
2003
IEEE
15 years 1 months ago
Efficient Reconstruction of Indoor Scenes with Color
In this paper we present an efficient and general approach to computing and integrating 3D distance fields directly from multiple range images. We compute normal and confidence va...
Rui Wang 0003, David P. Luebke
ICDE
2007
IEEE
106views Database» more  ICDE 2007»
15 years 4 months ago
Mining Trajectory Databases via a Suite of Distance Operators
With the rapid progress of mobile devices and positioning technologies, Trajectory Databases (TD) have been in the core of database research during the last decade. Analysis and k...
Nikos Pelekis, Ioannis Kopanakis, Irene Ntoutsi, G...