Sciweavers

3758 search results - page 266 / 752
» A Complete Subsumption Algorithm
Sort
View
IEEEPACT
2003
IEEE
15 years 11 months ago
Picking Statistically Valid and Early Simulation Points
Modern architecture research relies heavily on detailed pipeline simulation. Simulating the full execution of an industry standard benchmark can take weeks to months to complete. ...
Erez Perelman, Greg Hamerly, Brad Calder
COCO
2001
Springer
122views Algorithms» more  COCO 2001»
15 years 11 months ago
Hausdorff Dimension in Exponential Time
In this paper we investigate effective versions of Hausdorff dimension which have been recently introduced by Lutz. We focus on dimension in the class E of sets computable in line...
Klaus Ambos-Spies, Wolfgang Merkle, Jan Reimann, F...
ICDT
2001
ACM
162views Database» more  ICDT 2001»
15 years 11 months ago
Algebraic Rewritings for Optimizing Regular Path Queries
Rewriting queries using views is a powerful technique that has applications in query optimization, data integration, data warehousing etc. Query rewriting in relational databases ...
Gösta Grahne, Alex Thomo
VLDB
1997
ACM
104views Database» more  VLDB 1997»
15 years 10 months ago
A Generic Approach to Bulk Loading Multidimensional Index Structures
Abstract: Recently there has been an increasing interest in supporting bulk operations on multidimensional index structures. Bulk loading refers to the process of creating an initi...
Jochen Van den Bercken, Bernhard Seeger, Peter Wid...
COCO
1989
Springer
97views Algorithms» more  COCO 1989»
15 years 10 months ago
On the Structure of Bounded Queries to Arbitrary NP Sets
Kadin [6] showed that if the Polynomial Hierarchy (PH) has infinitely many levels, then for all k, PSAT[k] ⊂ PSAT[k+1]. This paper extends Kadin’s technique and shows that a p...
Richard Chang