Sciweavers

221 search results - page 21 / 45
» On Approximating the Radii of Point Sets in High Dimensions
Sort
View
SODA
1993
ACM
119views Algorithms» more  SODA 1993»
13 years 9 months ago
Iterated Nearest Neighbors and Finding Minimal Polytopes
We introduce a new method for nding several types of optimal k-point sets, minimizing perimeter, diameter, circumradius, and related measures, by testing sets of the O(k) nearest ...
David Eppstein, Jeff Erickson
STOC
2002
ACM
119views Algorithms» more  STOC 2002»
14 years 8 months ago
Space-efficient approximate Voronoi diagrams
Given a set S of n points in IRd , a (t, )-approximate Voronoi diagram (AVD) is a partition of space into constant complexity cells, where each cell c is associated with t represe...
Sunil Arya, Theocharis Malamatos, David M. Mount
SSD
2009
Springer
233views Database» more  SSD 2009»
14 years 2 months ago
Approximate Evaluation of Range Nearest Neighbor Queries with Quality Guarantee
The range nearest-neighbor (NN) query is an important query type in location-based services, as it can be applied to the case that an NN query has a spatial region, instead of a lo...
Chi-Yin Chow, Mohamed F. Mokbel, Joe Naps, Suman N...
SIGMOD
2001
ACM
142views Database» more  SIGMOD 2001»
14 years 7 months ago
Outlier Detection for High Dimensional Data
The outlier detection problem has important applications in the eld of fraud detection, network robustness analysis, and intrusion detection. Most such applications are high dimen...
Charu C. Aggarwal, Philip S. Yu
TVCG
2011
152views more  TVCG 2011»
13 years 2 months ago
Automated Analytical Methods to Support Visual Exploration of High-Dimensional Data
—Visual exploration of multivariate data typically requires projection onto lower-dimensional representations. The number of possible representations grows rapidly with the numbe...
Andrada Tatu, Georgia Albuquerque, Martin Eisemann...