1016 search results - page 50 / 204 » Generalized distances between rankings |
123
Voted
COMPGEOM
2009
ACM
15 years 7 months ago
2009
ACM
Following recent work of Clarkson, we translate the coreset framework to the problems of finding the point closest to the origin inside a polytope, finding the shortest distance...
114
click to vote
COMPGEOM
2005
ACM
15 years 2 months ago
2005
ACM
In this paper, we bound the difference between the total mean curvatures of two closed surfaces in R3 in terms of their total absolute curvatures and the Fr´echet distance betwee...
101
click to vote
ESANN
2008
15 years 2 months ago
2008
Abstract. Nonlinear dimensionality reduction aims at providing lowdimensional representions of high-dimensional data sets. Many new methods have been proposed in the recent years, ...
113
Voted
CVPR
2010
IEEE
15 years 8 months ago
2010
IEEE
Linear Discriminant Analysis (LDA) is a popular tool for multiclass discriminative dimensionality reduction. However, LDA suffers from two major problems: (1) It only optimizes th...
96
Voted
AAIM
2008
Springer
15 years 7 months ago
2008
Springer
The Kemeny Score problem is central to many applications in the context of rank aggregation. Given a set of permutations (votes) over a set of candidates, one searches for a “con...