Sciweavers

709 search results - page 87 / 142
» On LR(k)-Parsers of Polynomial Size
Sort
View
CORR
2012
Springer
209views Education» more  CORR 2012»
13 years 5 months ago
Aggregation in Probabilistic Databases via Knowledge Compilation
This paper presents a query evaluation technique for positive relational algebra queries with aggregates on a representation system for probabilistic data based on the algebraic s...
Robert Fink, Larisa Han, Dan Olteanu
SODA
2010
ACM
261views Algorithms» more  SODA 2010»
15 years 7 months ago
Bidimensionality and Kernels
Bidimensionality theory appears to be a powerful framework in the development of meta-algorithmic techniques. It was introduced by Demaine et al. [J. ACM 2005 ] as a tool to obtai...
Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, ...
ISPD
2009
ACM
141views Hardware» more  ISPD 2009»
15 years 4 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
DIS
2003
Springer
15 years 3 months ago
Abduction and the Dualization Problem
Computing abductive explanations is an important problem, which has been studied extensively in Artificial Intelligence (AI) and related disciplines. While computing some abductiv...
Thomas Eiter, Kazuhisa Makino
PODS
2010
ACM
150views Database» more  PODS 2010»
15 years 2 months ago
Understanding queries in a search database system
It is well known that a search engine can significantly benefit from an auxiliary database, which can suggest interpretations of the search query by means of the involved concep...
Ronald Fagin, Benny Kimelfeld, Yunyao Li, Sriram R...