4137 search results - page 141 / 828 » On the number of matchings of a tree |
197
click to vote
NAACL
2010
15 years 4 months ago
2010
In this paper, we describe an approach based on off-the-shelf parsers and semantic resources for the Recognizing Textual Entailment (RTE) challenge that can be generally applied t...
160
click to vote
ESWS
2009
Springer
16 years 1 months ago
2009
Springer
Despite serious research efforts, automatic ontology matching still suffers from severe problems with respect to the quality of matching results. Existing matching systems trade-of...
164
click to vote
BMCBI
2010
15 years 6 months ago
2010
Background: Genomic data provide a wealth of new information for phylogenetic analysis. Yet making use of this data requires phylogenetic methods that can efficiently analyze extr...
172
click to vote
CTRSA
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. A redactable signature scheme for a string of objects supports verification even if multiple substrings are removed from the original string. It is important that the re...
196
click to vote
ICDE
2007
IEEE
15 years 10 months ago
2007
IEEE
Suffix tree is an important data structure for indexing a long sequence (like a genome sequence) or a concatenation of sequences. It finds many applications in practice, especiall...