4469 search results - page 122 / 894 » Dynamic Program Slicing |
ICML
1995
IEEE
14 years 8 months ago
1995
IEEE
The success ofreinforcement learninginpractical problems depends on the ability to combine function approximation with temporal di erence methods such as value iteration. Experime...
VLDB
2007
ACM
14 years 8 months ago
2007
ACM
In this article, we propose a new approach for querying and indexing a database of trees with specific applications to XML datasets. Our approach relies on representing both the q...
AOSD
2010
ACM
14 years 2 months ago
2010
ACM
ESA
2009
Springer
14 years 2 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...
ISVC
2009
Springer
14 years 2 months 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...