8232 search results - page 357 / 1647 » Dynamic Logic Programming |
282
Voted
VLDB
2007
ACM
16 years 7 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...
146
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...
182
click to vote
ISVC
2009
Springer
16 years 1 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...