71 search results - page 10 / 15 » Embedding a set of rational points in lower dimensions |
102
click to vote
ICPR
2008
IEEE
15 years 6 months ago
2008
IEEE
For a finite set of points lying on a lower dimensional manifold embedded in a high-dimensional data space, algorithms have been developed to study the manifold structure. Howeve...
97
Voted
COMPGEOM
1995
ACM
15 years 3 months ago
1995
ACM
The range searching problem is a fundamental problem in computational geometry, with numerous important applications. Most research has focused on solving this problem exactly, bu...
SODA
2008
ACM
15 years 1 months ago
2008
ACM
The Earth Mover Distance (EMD) between two equalsize sets of points in Rd is defined to be the minimum cost of a bipartite matching between the two pointsets. It is a natural metr...
127
click to vote
ICASSP
2011
IEEE
14 years 3 months ago
2011
IEEE
The Restricted Isometry Property (RIP) is an important concept in compressed sensing. It is well known that many random matrices satisfy the RIP with high probability, whenever th...
97
Voted
COMPGEOM
2003
ACM
15 years 5 months ago
2003
ACM
We develop algorithms for computing the smallest enclosing ball of a set of n balls in d-dimensional space. Unlike previous methods, we explicitly address small cases (n ≤ d + 1...