2376 search results - page 188 / 476 » More Efficient Internal-Regret-Minimizing Algorithms |
CVPR
1999
IEEE
15 years 3 months ago
1999
IEEE
We formulate stereo matching as an extremal surface extraction problem. This is made possible by embedding the disparity surface inside a volume where the surface is composed of v...
100
click to vote
SIGGRAPH
1999
ACM
15 years 3 months ago
1999
ACM
Antialiasing of ray traced images is typically performed by supersampling the image plane. While this type of filtering works well for many algorithms, it is much more efficient t...
ACL
2008
15 years 19 days ago
2008
We propose the use of regular tree grammars (RTGs) as a formalism for the underspecified processing of scope ambiguities. By applying standard results on RTGs, we obtain a novel a...
COLING
1994
15 years 14 days ago
1994
The revised graph unification algorithms presented here are more efficient because they reduce the amount of copying that was necessary because of the assumption that data-structu...
IS
2002
14 years 10 months ago
2002
In this paper, we explore the possibility of transforming queries with minimum and maximum predicates into equivalent queries that can be computed more efficiently. The main contr...