Sciweavers

285 search results - page 41 / 57
» A New Heuristic for Optimizing Large Queries
Sort
View
SIGMOD
2010
ACM
208views Database» more  SIGMOD 2010»
13 years 6 months ago
An automated, yet interactive and portable DB designer
Tuning tools attempt to configure a database to achieve optimal performance for a given workload. Selecting an optimal set of physical structures is computationally hard since it ...
Ioannis Alagiannis, Debabrata Dash, Karl Schnaitte...
AAAI
2008
13 years 9 months ago
Lifted Probabilistic Inference with Counting Formulas
Lifted inference algorithms exploit repeated structure in probabilistic models to answer queries efficiently. Previous work such as de Salvo Braz et al.'s first-order variabl...
Brian Milch, Luke S. Zettlemoyer, Kristian Kerstin...
ICWS
2009
IEEE
14 years 4 months ago
RDF Data-Centric Storage
—The vision of the Semantic Web has brought about new challenges at the intersection of web research and data management. One fundamental research issue at this intersection is t...
Justin J. Levandoski, Mohamed F. Mokbel
VIS
2009
IEEE
211views Visualization» more  VIS 2009»
14 years 8 months ago
Isosurface Extraction and View-Dependent Filtering from Time-Varying Fields Using Persistent Time-Octree (PTOT)
We develop a new algorithm for isosurface extraction and view-dependent filtering from large time-varying fields, by using a novel Persistent Time-Octree (PTOT) indexing structure....
Cong Wang, Yi-Jen Chiang
EVOW
2003
Springer
14 years 22 days ago
Search Space Analysis of the Linear Ordering Problem
Abstract. The Linear Ordering Problem (LOP) is an NP-hard combinatorial optimization problem that arises in a variety of applications and several algorithmic approaches to its solu...
Tommaso Schiavinotto, Thomas Stützle