Sciweavers

6142 search results - page 424 / 1229
» The Complexity of Partition Functions
Sort
View
SIGMOD
1998
ACM
143views Database» more  SIGMOD 1998»
15 years 11 months ago
Optimal Multi-Step k-Nearest Neighbor Search
For an increasing number of modern database applications, efficient support of similarity search becomes an important task. Along with the complexity of the objects such as images...
Thomas Seidl, Hans-Peter Kriegel
MICRO
2007
IEEE
71views Hardware» more  MICRO 2007»
15 years 6 months ago
Effective Optimistic-Checker Tandem Core Design through Architectural Pruning
Design complexity is rapidly becoming a limiting factor in the design of modern, high-performance microprocessors. This paper introduces an optimization technique to improve the e...
Francisco J. Mesa-Martinez, Jose Renau
CP
2000
Springer
15 years 11 months ago
Random 3-SAT: The Plot Thickens
Abstract. This paper presents an experimental investigation of the following questions: how does the averagecase complexity of random 3-SAT, understood as a function of the order (...
Cristian Coarfa, Demetrios D. Demopoulos, Alfonso ...
AAAI
2007
15 years 9 months ago
DL-Lite in the Light of First-Order Logic
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 a...
Alessandro Artale, Diego Calvanese, Roman Kontchak...
SEBD
2007
121views Database» more  SEBD 2007»
15 years 8 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...