4137 search results - page 79 / 828 » On the number of matchings of a tree |
110
click to vote
ICDE
2010
IEEE
16 years 1 months ago
2010
IEEE
Abstract-- Despite of advances in machine learning technologies, a schema matching result between two database schemas (e.g., those derived from COMA++) is likely to be imprecise. ...
111
click to vote
COMBINATORICS
2007
15 years 1 months ago
2007
A simple 2-matching in a graph is a subgraph all of whose nodes have degree 1 or 2. A simple 2-matching is called k-restricted if every connected component has > k edges. We co...
110
click to vote
CBMS
2006
IEEE
15 years 5 months ago
2006
IEEE
A system has been developed to extract bibliographic data (grant numbers and databank accession numbers) from online biomedical journal articles for the National Library of Medici...
120
click to vote
JCB
2006
15 years 1 months ago
2006
Tree structures are useful for describing and analyzing biological objects and processes. Consequently, there is a need to design metrics and algorithms to compare trees. A natura...
136
click to vote
EACL
2006
ACL Anthology
15 years 3 months ago
2006
ACL Anthology
We place synchronous tree-adjoining grammars and tree transducers in the single overarching framework of bimorphisms, continuing the unification of synchronous grammars and tree t...