558 search results - page 40 / 112 » Trees and Matchings |
ESA
2009
Springer
15 years 6 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...
AEI
2006
14 years 12 months ago
2006
Machine Learning algorithms can act as a valuable analytical tool in design research. In this paper, we demonstrate the application of a decision tree learning algorithm for desig...
ATVA
2008
Springer
15 years 1 months ago
2008
Springer
Classical verification often uses abstraction when dealing with data. On the other hand, dynamic XML-based applications have become pervasive, for instance with the ever growing im...
CVPR
2007
IEEE
16 years 1 months ago
2007
IEEE
We look at the problem of location recognition in a large image dataset using a vocabulary tree. This entails finding the location of a query image in a large dataset containing 3...
COMPGEOM
1993
ACM
15 years 3 months ago
1993
ACM
We consider graphs such as the minimum spanning tree, minimum Steiner tree, minimum matching, and traveling salesman tour for n points in the d-dimensional unit cube. For each of ...