1994 search results - page 98 / 399 » Computation of Optical Flow Using Dynamic Programming |
120
click to vote
ICPR
2010
IEEE
15 years 4 months ago
2010
IEEE
Many vision applications have been formulated as Markov Random Field (MRF) problems. Although many of them are discrete labeling problems, continuous formulation often achieves gre...
112
click to vote
JSAC
2006
14 years 9 months ago
2006
Routing and wavelength assignment (RWA) aims to assign the limited number of wavelengths in a wavelength-division multiplexed (WDM) optical network so as to achieve greater capacit...
PATAT
2004
Springer
15 years 3 months ago
2004
Springer
Timetabling problems have been frequently studied due to their wide range of applications. However, they are often solved manually because of the lack of appropriate computer tools...
EOR
2006
14 years 9 months ago
2006
: This paper addresses the problem of computing minimum risk paths by taking as objective the expected accident cost. The computation is based on a dynamic programming formulation ...
APPT
2007
Springer
14 years 11 months ago
2007
Springer
Dynamic programming is a widely applied algorithm design technique in many areas such as computational biology and scientific computing. Typical applications using this technique a...