2583 search results - page 321 / 517 » On the Representation of Timed Polyhedra |
159
click to vote
SCALESPACE
1999
Springer
15 years 10 months ago
1999
Springer
Abstract. Multiresolution techniques are often used to shorten the execution times of dynamic programming based deformable contour optimization methods by decreasing the image reso...
159
click to vote
AMAST
1998
Springer
15 years 10 months ago
1998
Springer
The goal of this paper is to develop an algebraic theory of process scheduling. We specify a syntax for denoting processes composed of actions with given durations. Subsequently, w...
179
click to vote
SEAL
1998
Springer
15 years 10 months ago
1998
Springer
Genetic programming evolves Lisp-like programs rather than fixed size linear strings. This representational power combined with generality makes genetic programming an interesting ...
160
click to vote
CPM
1997
Springer
15 years 10 months ago
1997
Springer
We show an ecient pattern matching algorithm for strings that are succinctly described in terms of straight-line programs, in which the constants are symbols and the only operati...
152
click to vote
STACS
1992
Springer
15 years 10 months ago
1992
Springer
In this paper we give a practical and e cient output-sensitive algorithm for constructing the display of a polyhedral terrain. It runs in Od + nlog2 n time and uses On n space, wh...