9572 search results - page 324 / 1915 » Cover Algorithms and Their Combination |
173
click to vote
AMAI
2005
Springer
15 years 6 months ago
2005
Springer
A CNF formula is called matched if its associated bipartite graph (whose vertices are clauses and variables) has a matching that covers all clauses. Matched CNF formulas are satisf...
183
click to vote
TOC
2008
15 years 6 months ago
2008
: Ahlswede and Winter [IEEE Trans. Inf. Th. 2002] introduced a Chernoff bound for matrix-valued random variables, which is a non-trivial generalization of the usual Chernoff bound ...
169
click to vote
JDWM
2007
15 years 6 months ago
2007
Rule induction from examples is a machine learning technique that finds rules of the form condition → class, where condition and class are logic expressions of the form variable...
184
click to vote
CIKM
2009
Springer
15 years 4 months ago
2009
Springer
Traditional models of information retrieval assume documents are independently relevant. But when the goal is retrieving diverse or novel information about a topic, retrieval mode...
195
click to vote
BMCBI
2010
15 years 6 months ago
2010
Background: Traditional algorithms for hidden Markov model decoding seek to maximize either the probability of a state path or the number of positions of a sequence assigned to th...