6274 search results - page 148 / 1255 » From query complexity to computational complexity |
246
click to vote
ICDE
2002
IEEE
16 years 5 months ago
2002
IEEE
Nearest Neighbor search is an important and widely used problem in a number of important application domains. In many of these domains, the dimensionality of the data representati...
132
click to vote
COCO
2003
Springer
15 years 9 months ago
2003
Springer
We consider a fundamental problem in data structures, static predecessor searching: Given a subset S of size n from the universe [m], store S so that queries of the form “What i...
128
click to vote
ICEIS
2006
IEEE
15 years 10 months ago
2006
IEEE
The satisfiability test checks, whether or not the evaluation of a query returns the empty set for any input document, and can be used in query optimization for avoiding the submis...
138
Voted
ICRA
2006
IEEE
15 years 10 months ago
2006
IEEE
— The configuration space of a robot is partitioned into free space and C-obstacle space. Most of the prior work in collision detection and motion planning algorithms is targete...
165
click to vote
ICPADS
2005
IEEE
15 years 9 months ago
2005
IEEE
Data warehouses store large volumes of data according to a multidimensional model with dimensions representing different axes of analysis. OLAP systems (OnLine Analytical Processi...