4137 search results - page 132 / 828 » On the number of matchings of a tree |
183
click to vote
ECCC
2010
15 years 5 months ago
2010
Bodlaender’s Theorem states that for every k there is a linear-time algorithm that decides whether an input graph has tree width k and, if so, computes a width-k tree compositio...
228
click to vote
BMCBI
2011
14 years 10 months ago
2011
Background: The secondary structure of RNA molecules is intimately related to their function and often more conserved than the sequence. Hence, the important task of searching dat...
242
click to vote
KSEM
2007
Springer
16 years 19 days ago
2007
Springer
Traditional phrase matching approaches, which can discover documents containing exactly the same phrases, fail to detect documents including phrases that are semantically relevant,...
253
click to vote
BCS
2008
15 years 8 months ago
2008
: The SIFT algorithm (Scale Invariant Feature Transform) proposed by Lowe [1] is an approach for extracting distinctive invariant features from images. It has been successfully app...
145
click to vote
KAIS
2006
15 years 6 months ago
2006
This paper defines a challenging problem of pattern matching between a pattern P and a text T, with wildcards and length constraints, and designs an efficient algorithm to return e...