4469 search results - page 511 / 894 » Dynamic Program Slicing |
170
click to vote
LATIN
2010
Springer
15 years 12 months ago
2010
Springer
In this paper, we consider Steiner forest and its generalizations, prize-collecting Steiner forest and k-Steiner forest, when the vertices of the input graph are points in the Euc...
199
click to vote
PPOPP
1999
ACM
15 years 11 months ago
1999
ACM
Divide and conquer algorithms are a good match for modern parallel machines: they tend to have large amounts of inherent parallelism and they work well with caches and deep memory...
189
click to vote
ICEIS
1999
IEEE
15 years 11 months ago
1999
IEEE
: Contour Estimation, Bayesian Estimation, Random Fields, Dynamic Programming, Multigrid Methods. This paper addresses contour estimation on images modeled as piecewise homogeneous...
171
click to vote
SCALESPACE
1999
Springer
15 years 11 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...
160
click to vote
SAC
1996
ACM
15 years 11 months ago
1996
ACM
Gaining the code re-use advantages of object oriented programming requires dynamic function binding, which allows a new subclass to override a function of a superclass. Dynamic bi...