8825 search results - page 69 / 1765 » All for one or one for all |
IPPS
1998
IEEE
15 years 5 months ago
1998
IEEE
including the one proposed in [5]. Minieka showed that all the eight problems can be solved in polynomial time except the one of finding the maximum distancesum tree of a specified...
113
click to vote
CORIA
2009
15 years 2 months ago
2009
Relying on the Cluster Hypothesis, which states that relevant documents tend to be more similar one to each other than to non-relevant ones, most of information retrieval systems p...
JUCS
2006
15 years 1 months ago
2006
: We cast a new look on time-varying distributed H systems. In their original definition, where only new strings are passed to the next component, this language definition in itsel...
204
click to vote
EJASMP
2011
14 years 4 months ago
2011
We address the question of whether and how boosting and bagging can be used for speech recognition. In order to do this, we compare two different boosting schemes, one at the pho...
113
click to vote
RECOMB
2006
Springer
16 years 1 months ago
2006
Springer
We study the problem of enumerating substrings that are common amongst genomes that share evolutionary descent. For example, one might want to enumerate all identical (therefore co...