Sciweavers

499 search results - page 5 / 100
» A Dynamic-Programming Based ASP-Solver
Sort
View
JSAC
2006
79views more  JSAC 2006»
13 years 7 months ago
Layered Multicast Rate Control Based on Lagrangian Relaxation and Dynamic Programming
In this paper, we address the rate control problem for layered multicast traffic, with the objective of solving a generalized throughput/fairness objective. Our approach is based o...
Koushik Kar, Leandros Tassiulas
CVPR
2000
IEEE
14 years 9 months ago
Improved Motion Stereo Matching Based on a Modified Dynamic Programming
A new method for computing precise depth map estimates of 3D shape of a moving object is proposed. 3D shape recovery in motion stereo is formulated as a matching optimization prob...
Mikhail Mozerov, Vitaly Kober, Tae-Sun Choi
JACIII
2008
148views more  JACIII 2008»
13 years 7 months ago
Optimal Route Based on Dynamic Programming for Road Networks
Abstract. One of the main functions of the traffic navigation systems is to find the optimal route to the destination. In this paper, we propose an iterative Q value updating algor...
Manoj Kanta Mainali, Kaoru Shimada, Shingo Mabu, K...
ICIP
2008
IEEE
14 years 9 months ago
Robust snake convergence based on dynamic programming
The extraction of contours using deformable models, such as snakes, is a problem of great interest in computer vision, particular in areas of medical imaging and tracking. Snakes ...
Akshaya Kumar Mishra, Paul W. Fieguth, David A. Cl...
ISVC
2009
Springer
14 years 2 months ago
Deformable 2D Shape Matching Based on Shape Contexts and Dynamic Programming
This paper presents a method for matching closed, 2D shapes (2D object silhouettes) that are represented as an ordered collection of shape contexts [1]. Matching is performed using...
Iasonas Oikonomidis, Antonis A. Argyros