2490 search results - page 325 / 498 » Complexity of Contextual Reasoning |
145
click to vote
ICIP
1998
IEEE
15 years 8 months ago
1998
IEEE
The block-matching motion estimation algorithm using a translational motion model cannot provide acceptable image quality in low bit-rate coding. To improve coding performance, we ...
130
click to vote
SIGMOD
1996
ACM
15 years 8 months ago
1996
ACM
Magic sets rewriting is a well-known optimization heuristic for complex decision-support queries. There can be many variants of this rewriting even for a single query, which diffe...
151
click to vote
CC
2006
Springer
15 years 8 months ago
2006
Springer
The polyhedral model is known to be a powerful framework to reason about high level loop transformations. Recent developments in optimizing compilers broke some generally accepted ...
152
click to vote
COCO
2006
Springer
15 years 8 months ago
2006
Springer
We give an algorithm that learns any monotone Boolean function f : {-1, 1}n {-1, 1} to any constant accuracy, under the uniform distribution, in time polynomial in n and in the de...
140
click to vote
DBPL
1995
Springer
15 years 8 months ago
1995
Springer
We study the problem of maintaining recursively-de ned views, such as the transitive closure of a relation, in traditional relational languages that do not have recursion mechanis...