221 search results - page 29 / 45 » On Approximating the Radii of Point Sets in High Dimensions |
CCGRID
2002
IEEE
14 years 18 days ago
2002
IEEE
A scalable and expressive peer-to-peer (P2P) networking and computing framework requires efficient resource discovery services. Here we propose NEVRLATE, for Network-Efficient V...
COMPGEOM
2008
ACM
13 years 9 months ago
2008
ACM
Manifold reconstruction has been extensively studied for the last decade or so, especially in two and three dimensions. Recent advances in higher dimensions have led to new method...
FOCS
2006
IEEE
14 years 1 months ago
2006
IEEE
d abstract] Robert Krauthgamer ∗ IBM Almaden James R. Lee † Institute for Advanced Study We initiate the study of approximate algorithms on negatively curved spaces. These spa...
SIGMOD
2003
ACM
14 years 7 months ago
2003
ACM
The skyline of a set of d-dimensional points contains the points that are not dominated by any other point on all dimensions. Skyline computation has recently received considerabl...
ICML
2009
IEEE
14 years 8 months ago
2009
IEEE
This paper addresses feature selection techniques for classification of high dimensional data, such as those produced by microarray experiments. Some prior knowledge may be availa...