87 search results - page 11 / 18 » Nearest Singular Polynomials |
ICDE
1999
IEEE
14 years 8 months ago
1999
IEEE
Time series stored as feature vectors can be indexed by multidimensional index trees like R-Trees for fast retrieval. Due to the dimensionality curse problem, transformations are ...
AAECC
2010
Springer
13 years 7 months ago
2010
Springer
The aim of this paper is a comprehensive presentation of the geometrical tools which are necessary to prove the correctness of several up to date algorithms with intrinsic complex...
SODA
2000
ACM
13 years 8 months ago
2000
ACM
In this paper we give approximation algorithms for several proximity problems in high dimensional spaces. In particular, we give the rst Las Vegas data structure for (1 + )-neares...
FOCS
2008
IEEE
14 years 2 months ago
2008
IEEE
This work investigates a geometric approach to proving cell probe lower bounds for data structure problems. We consider the approximate nearest neighbor search problem on the Bool...
JNS
2010
13 years 2 months ago
2010
We consider statistical mechanics systems defined on a set with some symmetry properties (namely, the set admits an action by a group, which is finitely generated and residually fi...