4137 search results - page 53 / 828 » On the number of matchings of a tree |
117
click to vote
ASPDAC
2005
ACM
15 years 3 months ago
2005
ACM
— Motivated by VLSI/ULSI routing applications, we present a heuristic for rectilinear Steiner minimal tree (RSMT) construction. We transform a rectilinear minimum spanning tree (...
152
click to vote
EMNLP
2004
15 years 3 months ago
2004
Given a parallel parsed corpus, statistical treeto-tree alignment attempts to match nodes in the syntactic trees for a given sentence in two languages. We train a probabilistic tr...
SIAMCOMP
2000
15 years 1 months ago
2000
We modify the k-d tree on [0, 1]d by always cutting the longest edge instead of rotating through the coordinates. This modification makes the expected time behavior of lowerdimensi...
134
Voted
ICASSP
2007
IEEE
15 years 8 months ago
2007
IEEE
Alterations in the number of DNA copies are very common in tumor cells and may have a very important role in cancer development and progression. New array platforms provide means ...
104
click to vote
ICPR
2002
IEEE
16 years 2 months ago
2002
IEEE
The graph is an essential data structure for representing relational information. When graphs are used to represent objects, comparing objects amounts to graph matching. Inexact g...