4137 search results - page 124 / 828 » On the number of matchings of a tree |
162
click to vote
COMPGEOM
1993
ACM
15 years 10 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 ...
157
click to vote
ORL
2008
15 years 6 months ago
2008
This paper focuses on tractable instances of interval data minmax regret graph problems. More precisely, we provide polynomial and pseudopolynomial algorithms for sets of particul...
142
click to vote
ACL
2009
15 years 4 months ago
2009
We present a novel transition system for dependency parsing, which constructs arcs only between adjacent words but can parse arbitrary non-projective trees by swapping the order o...
188
click to vote
AUSDM
2008
Springer
15 years 8 months ago
2008
Springer
Share-frequent pattern mining discovers more useful and realistic knowledge from database compared to the traditional frequent pattern mining by considering the non-binary frequen...
190
click to vote
SIGMOD
2003
ACM
16 years 6 months ago
2003
ACM
With the growing importance of XML in data exchange, much research has been done in providing flexible query facilities to extract data from structured XML documents. In this pape...