18306 search results - page 3251 / 3662 » Algorithmics in Exponential Time |
114
click to vote
DAM
2010
15 years 3 months ago
2010
Let G be a multigraph. We say that G is 1-extendable if every edge of G is contained in a 1-factor. Suppose G is 1-extendable. An excessive factorization of G is a set F = {F1, F2...
157
click to vote
DSP
2008
15 years 3 months ago
2008
In this work, we propose to improve the neighboring relationship ability of the Hidden Markov Chain (HMC) model, by extending the memory lengthes of both the Markov chain process ...
121
click to vote
ARTMED
2006
15 years 3 months ago
2006
Manual classification of free-text documents within a predefined hierarchy is highly time consuming. This is especially true for clinical guidelines, which are often indexed by mu...
158
click to vote
ASC
2006
15 years 3 months ago
2006
For some time, learning Bayesian networks has been both feasible and useful in many problems domains. Recently research has been done on learning equivalence classes of Bayesian n...
128
click to vote
BIOINFORMATICS
2006
15 years 3 months ago
2006
Motivation: In the Affymetrix GeneChip system, preprocessing occurs before one obtains expression level measurements. Because the number of competing preprocessing methods was lar...