221 search results - page 2 / 45 » On Approximating the Radii of Point Sets in High Dimensions |
CCCG
2009
13 years 6 months ago
2009
In structural molecular biology software, the accessibility of an atom in a molecule to a ball representing solvent is either computed slowly by building a solventaccessible surfa...
COMPGEOM
2006
ACM
13 years 11 months ago
2006
ACM
We consider a class of geometric facility location problems in which the goal is to determine a set X of disks given by their centers (tj) and radii (rj) that cover a given set of...
EDBT
2006
ACM
14 years 5 months ago
2006
ACM
In many decision-making applications, the skyline query is frequently used to find a set of dominating data points (called skyline points) in a multidimensional dataset. In a high-...
SODA
2010
ACM
14 years 3 months ago
2010
ACM
We consider the problem of approximating a set P of n points in Rd by a j-dimensional subspace under the p measure, in which we wish to minimize the sum of p distances from each p...
SISAP
2008
IEEE
13 years 12 months ago
2008
IEEE
There are several pieces of information that can be utilized in order to improve the efficiency of similarity searches on high-dimensional data. The most commonly used information...