6315 search results - page 138 / 1263 » Approximating Solution Structure |
183
click to vote
COMPGEOM
1997
ACM
15 years 10 months ago
1997
ACM
This paper proposes new methods to answer approximate nearest neighbor queries on a set of n points in d-dimensional Euclidean space. For any xed constant d, a data structure with...
154
click to vote
IPCO
2001
15 years 7 months ago
2001
We investigate network design under volatile conditions of link failures and traffic overload. Our model is a non-simultaneous 2-commodity problem. We characterize the feasible so...
159
click to vote
SISAP
2008
IEEE
16 years 24 days ago
2008
IEEE
Many contemporary database applications require similarity-based retrieval of complex objects where the only usable knowledge of its domain is determined by a metric distance func...
163
click to vote
CCCG
2006
15 years 7 months ago
2006
For a given point set in Euclidean space we consider the problem of finding (approximate) nearest neighbors of a query point but restricting only to points that lie within a fixed...
198
click to vote
GECCO
2008
Springer
15 years 7 months ago
2008
Springer
Pair approximations have often been used to predict equilibrium conditions in spatially-explicit epidemiological and ecological systems. In this work, we investigate whether this ...