4469 search results - page 284 / 894 » Dynamic Program Slicing |
109
click to vote
CORR
2007
Springer
15 years 2 months ago
2007
Springer
— This paper explores optimization of paging and registration policies in cellular networks. Motion is modeled as a discrete-time Markov process, and minimization of the discount...
122
click to vote
CORR
2007
Springer
15 years 2 months ago
2007
Springer
: We propose a new algorithm to the problem of polygonal curve approximation based on a multiresolution approach. This algorithm is suboptimal but still maintains some optimality b...
106
click to vote
IJCV
2002
15 years 1 months ago
2002
This paper describes a new algorithm for disparity estimation using trinocular stereo. The three cameras are placed in a right angled configuration. A graph is then constructed wh...
137
click to vote
ISVC
2010
Springer
15 years 18 days ago
2010
Springer
Abstract. We propose an improved shape matching algorithm that extends the work of Felzenszwalb [3]. In this approach, we use triangular meshes to represent deformable objects and ...
131
click to vote
ML
2010
ACM
15 years 17 days ago
2010
ACM
Abstract A dynamic programming algorithm for constructing optimal dyadic decision trees was recently introduced, analyzed, and shown to be very effective for low dimensional data ...