Sciweavers

297 search results - page 45 / 60
» Polynomial heuristics for query optimization
Sort
View
EDBT
2002
ACM
132views Database» more  EDBT 2002»
14 years 7 months ago
A Framework for the Physical Design Problem for Data Synopses
Maintaining statistics on multidimensional data distributions is crucial for predicting the run-time and result size of queries and data analysis tasks with acceptable accuracy. To...
Arnd Christian König, Gerhard Weikum
AAAI
2010
13 years 6 months ago
Simultaneous Elicitation of Preference Features and Utility
Most frameworks for utility elicitation assume a predefined set of features over which user preferences are expressed. We consider utility elicitation in the presence of subjecti...
Craig Boutilier, Kevin Regan, Paolo Viappiani
ISPD
2009
ACM
141views Hardware» more  ISPD 2009»
14 years 2 months ago
A faster approximation scheme for timing driven minimum cost layer assignment
As VLSI technology moves to the 65nm node and beyond, interconnect delay greatly limits the circuit performance. As a critical component in interconnect synthesis, layer assignmen...
Shiyan Hu, Zhuo Li, Charles J. Alpert
PODS
2007
ACM
159views Database» more  PODS 2007»
14 years 7 months ago
Generalized hypertree decompositions: np-hardness and tractable variants
The generalized hypertree width GHW(H) of a hypergraph H is a measure of its cyclicity. Classes of conjunctive queries or constraint satisfaction problems whose associated hypergr...
Georg Gottlob, Thomas Schwentick, Zoltán Mi...
DAC
2001
ACM
14 years 8 months ago
Performance-Driven Multi-Level Clustering with Application to Hierarchical FPGA Mapping
In this paper, we study the problem of performance-driven multi-level circuit clustering with application to hierarchical FPGA designs. We first show that the performance-driven m...
Jason Cong, Michail Romesis