Sciweavers

332 search results - page 12 / 67
» Space Complexity vs. Query Complexity
Sort
View
STOC
2001
ACM
151views Algorithms» more  STOC 2001»
14 years 10 months ago
On the cell probe complexity of membership and perfect hashing
We study two fundamental static data structure problems, membership and perfect hashing, in Yao's cell probe model. The first space and bit probe optimal worst case upper bou...
Rasmus Pagh
VLDB
1997
ACM
97views Database» more  VLDB 1997»
14 years 2 months ago
The Complexity of Transformation-Based Join Enumeration
Query optimizers that explore a search space exhaustively using transformation rules usually apply all possible rules on each alternative, and stop when no new information is prod...
Arjan Pellenkoft, César A. Galindo-Legaria,...
BDA
2007
13 years 11 months ago
Hyperplane Queries in a Feature-Space M-tree for Speeding up Active Learning
In content-based retrieval, relevance feedback (RF) is a noticeable method for reducing the “semantic gap” between the low-level features describing the content and the usually...
Michel Crucianu, Daniel Estevez, Vincent Oria, Jea...
SEBD
2007
121views Database» more  SEBD 2007»
13 years 11 months ago
Query Answering in Expressive Variants of DL-Lite
The use of ontologies in various application domains, such as Data Integration, the Semantic Web, or ontology-based data management, where ontologies provide the access to large am...
Alessandro Artale, Diego Calvanese, Roman Kontchak...
GEOINFORMATICA
2008
123views more  GEOINFORMATICA 2008»
13 years 10 months ago
Efficient Implementation Techniques for Topological Predicates on Complex Spatial Objects
Topological relationships like overlap, inside, meet, and disjoint uniquely characterize the relative position between objects in space. For a long time, they have been a focus of...
Reasey Praing, Markus Schneider