9572 search results - page 344 / 1915 » Cover Algorithms and Their Combination |
150
click to vote
COLT
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. We consider the design of online master algorithms for combining the predictions from a set of experts where the absolute loss of the master is to be close to the absolut...
168
click to vote
CSR
2010
Springer
15 years 10 months ago
2010
Springer
Abstract. The Hamiltonian cycle problem (HCP) is an important combinatorial problem with applications in many areas. While thorough theoretical and experimental analyses have been ...
155
Voted
ACCV
2007
Springer
16 years 28 days ago
2007
Springer
The traditional co-training algorithm, which needs a great number of unlabeled examples in advance and then trains classifiers by iterative learning approach, is not suitable for ...
186
click to vote
CPM
2005
Springer
16 years 8 days ago
2005
Springer
Abstract. The Knuth-Morris-Pratt (KMP) pattern-matching algorithm guarantees both independence from alphabet size and worst-case execution time linear in the pattern length; on the...
174
click to vote
WAOA
2005
Springer
16 years 6 days ago
2005
Springer
MAX SAT and MAX NAE-SAT are central problems in theoretical computer science. We present an approximation algorithm for MAX NAE-SAT with a conjectured performance guarantee of 0.82...