22 search results - page 1 / 5 » Coresets for polytope distance |
COMPGEOM
2009
ACM
13 years 11 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...
SIAMDM
2010
13 years 3 months ago
2010
This paper is concerned with the minimum distance computation for higher dimensional toric codes defined by lattice polytopes in Rn . We show that the minimum distance is multipli...
DCG
2007
13 years 4 months ago
2007
We consider polytopes in Rn that are generated by N vectors in Rn whose coordinates are independent subgaussian random variables. (A particular case of such polytopes are symmetri...
ICASSP
2011
IEEE
12 years 8 months ago
2011
IEEE
We present a polytope-kernel density estimation (PKDE) methodology that allows us to perform exact mean-shift updates along the edges of the Delaunay graph of the data. We discuss...
STACS
2007
Springer
13 years 10 months ago
2007
Springer
The min-sum k-clustering problem is to partition a metric space (P, d) into k clusters C1, . . . , Ck ⊆ P such that k i=1 p,q∈Ci d(p, q) is minimized. We show the first effi...