1016 search results - page 104 / 204 » Generalized distances between rankings |
106
click to vote
ALGORITHMICA
2007
15 years 1 months ago
2007
A tree t-spanner T in a graph G is a spanning tree of G such that the distance between every pair of vertices in T is at most t times their distance in G. The tree t-spanner proble...
142
click to vote
ALGORITHMICA
2004
15 years 1 months ago
2004
We study the Hausdorff Voronoi diagram of point clusters in the plane, a generalization of Voronoi diagrams based on the Hausdorff distance function. We derive a tight combinatori...
161
click to vote
TKDE
2011
14 years 8 months ago
2011
—This work introduces a link-analysis procedure for discovering relationships in a relational database or a graph, generalizing both simple and multiple correspondence analysis. ...
145
click to vote
COMPUTING
2007
15 years 1 months ago
2007
In this paper we consider error estimation for image restoration problems based on generalized Bregman distances. This error estimation technique has been used to derive convergen...
110
click to vote
CVPR
1997
IEEE
15 years 5 months ago
1997
IEEE
We describe a new method for camera autocalibration and scaled Euclidean structure and motion, from three or more views taken by a moving camera with fixed but unknown intrinsic ...