11740 search results - page 103 / 2348 » More Problems in Rewriting |
118
click to vote
PVLDB
2008
15 years 3 months ago
2008
OLAP servers based on relational backends typically exploit materialized aggregate tables to improve response times of complex analytical queries. One of the key problems in this ...
132
click to vote
PVLDB
2010
15 years 2 months ago
2010
Independence analysis is the problem of determining whether an update affects the result of a query, e.g. a constraint or materialized view. We develop a new, modular framework fo...
130
click to vote
CASES
2010
ACM
15 years 2 months ago
2010
ACM
Common generated instruction selections are based on tree pattern matching, but modern and custom architectures feature instructions, which cannot be covered by trees. To overcome...
133
click to vote
JGO
2010
14 years 11 months ago
2010
The best known method to find exact or at least -approximate solutions to polynomial programming problems is the spatial Branch-and-Bound algorithm, which rests on computing lower...
195
click to vote
JMLR
2010
14 years 11 months ago
2010
In this paper, we propose a general framework for sparse semi-supervised learning, which concerns using a small portion of unlabeled data and a few labeled data to represent targe...