564 search results - page 50 / 113 » Error-tolerant Tree Matching |
ORL
2008
14 years 12 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...
77
Voted
ACL
2009
14 years 9 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...
RECOMB
2009
Springer
16 years 15 days ago
2009
Springer
Abstract. Hierarchical clustering is a popular method for grouping together similar elements based on a distance measure between them. In many cases, annotation information for som...
119
click to vote
SIGMOD
2003
ACM
16 years 1 days 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...
CVPR
2010
IEEE
15 years 8 months ago
2010
IEEE
Many computer vision problems involving feature correspondence among images can be formulated as an assignment problem with a quadratic cost function. Such problems are computatio...