5757 search results - page 199 / 1152 » Dynamic Policy Programming |
132
Voted
AOSD
2010
ACM
16 years 1 months ago
2010
ACM
140
click to vote
ESA
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. In this paper, we show that algorithms on tree decompositions can be made faster with the use of generalisations of fast subset convolution. Amongst others, this gives al...
172
click to vote
ISVC
2009
Springer
16 years 29 days ago
2009
Springer
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...
147
Voted
ISPD
2010
ACM
16 years 28 days ago
2010
ACM
118
Voted
CDC
2008
IEEE
16 years 27 days ago
2008
IEEE