332 search results - page 19 / 67 » Space Complexity vs. Query Complexity |
CORR
1999
Springer
13 years 9 months ago
1999
Springer
Complex queries are becoming commonplace, with the growing use of decision support systems. These complex queries often have a lot of common sub-expressions, either within a singl...
COMPGEOM
1994
ACM
14 years 1 months ago
1994
ACM
Ray (segment) shooting is the problem of determining the first intersection between a ray (directed line segment) and a collection of polygonal or polyhedral obstacles. In order t...
CORR
2012
Springer
12 years 5 months ago
2012
Springer
We consider the problem of recovering items matching a partially specified pattern in multidimensional trees (quad trees and k-d trees). We assume the classical model where the d...
PERCOM
2010
ACM
13 years 8 months ago
2010
ACM
This paper addresses quality vs. cost tradeoffs in multisensor pervasive spaces. Specifically, we focus on a case study that uses location sensing in instrumented pervasive spaces ...
SEBD
1997
13 years 11 months ago
1997
M-tree is a dynamic access method suitable to index generic “metric spaces”, where the function used to compute the distance between any two objects satisfies the positivity, ...