6315 search results - page 303 / 1263 » Approximating Solution Structure |
203
click to vote
SODA
2010
ACM
15 years 4 months ago
2010
ACM
Consider the following problem: given a metric space, some of whose points are "clients," select a set of at most k facility locations to minimize the average distance f...
206
click to vote
COMPGEOM
2004
ACM
16 years 3 days ago
2004
ACM
We present a novel Locality-Sensitive Hashing scheme for the Approximate Nearest Neighbor Problem under ÐÔ norm, based on Ôstable distributions. Our scheme improves the running...
156
click to vote
WSC
1998
15 years 8 months ago
1998
Constructing models of systems that change their structure over time has proved to be a challenging problem, with several proposed solutions. We present two of these approaches an...
187
click to vote
WADS
1997
Springer
15 years 10 months ago
1997
Springer
We present several efficient dynamic data structures for point-enclosure queries, involving convex fat objects in R2 or R3. Our planar structures are actually fitted for a more ...
185
click to vote
DMDW
2003
15 years 8 months ago
2003
: Two main problems arise in modelling data warehouse structures. The first consists in establishing an adequate representation of dimensions in order to facilitate and to control ...