6568 search results - page 290 / 1314 » Reducing the Complexity of Reductions |
167
click to vote
LMCS
2007
15 years 6 months ago
2007
Higher-Order Fixpoint Logic (HFL) is a hybrid of the simply typed λ-calculus and the modal µ-calculus. This makes it a highly expressive temporal logic that is capable of express...
162
click to vote
ESOP
2001
Springer
15 years 11 months ago
2001
Springer
Constant propagation (CP) is one of the most widely used optimizations in practice (cf. [9]). Intuitively, it addresses the problem of statically detecting whether an expression al...
134
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
An answer to a query has a well-defined lineage expression (alternatively called how-provenance) that explains how the answer was derived. Recent work has also shown how to comput...
179
click to vote
FOCS
2007
IEEE
16 years 1 months ago
2007
IEEE
In this paper, we resolve the smoothed and approximative complexity of low-rank quasi-concave minimization, providing both upper and lower bounds. As an upper bound, we provide th...
252
click to vote
SIGMOD
2008
ACM
16 years 7 months ago
2008
ACM
Today's query processing engines do not take advantage of the multiple occurrences of a relation in a query to improve performance. Instead, each instance is treated as a dis...