1326 search results - page 152 / 266 » Approximate Tree Kernels |
179
click to vote
IJCNLP
2005
Springer
15 years 12 months ago
2005
Springer
Abstract. In this paper, we explore the syntactic relation patterns for opendomain factoid question answering. We propose a pattern extraction method to extract the various relatio...
191
click to vote
BTW
2007
Springer
15 years 10 months ago
2007
Springer
: Relational database systems are highly efficient hosts to table-shaped data. It is all the more interesting to see how a careful inspection of both, the XML tree structure as wel...
158
click to vote
DAM
2010
15 years 6 months ago
2010
Abstract. A set of phylogenetic trees with overlapping leaf sets is consistent if it can be merged without conflicts into a supertree. In this paper, we study the polynomial-time a...
198
click to vote
STOC
2006
ACM
16 years 6 months ago
2006
ACM
Let > 0 be a constant. For any edge-weighted planar graph G and a subset S of nodes of G, there is a subgraph H of G of weight a constant times that of the minimum Steiner tree...
147
click to vote
ICALP
2005
Springer
15 years 12 months ago
2005
Springer
We define an algorithmic paradigm, the stack model, that captures many primal-dual and local-ratio algorithms for approximating covering and packing problems. The stack model is ...