381 search results - page 17 / 77 » On the advantage over a random assignment |
COLT
2005
Springer
14 years 2 months ago
2005
Springer
In recent work Long and Servedio [LS05] presented a “martingale boosting” algorithm that works by constructing a branching program over weak classifiers and has a simple anal...
DCC
2008
IEEE
14 years 8 months ago
2008
IEEE
A method is proposed for the compression of hyperspectral signature vectors on severely resourceconstrained encoding platforms. The proposed technique, compressive-projection prin...
AAAI
2008
13 years 11 months ago
2008
The survey propagation (SP) algorithm has been shown to work well on large instances of the random 3-SAT problem near its phase transition. It was shown that SP estimates marginal...
GECCO
2007
Springer
14 years 3 months ago
2007
Springer
In this paper, we analyze two general-purpose encoding types, trees and graphs systematically, focusing on trends over increasingly complex problems. Tree and graph encodings are ...
VTC
2006
IEEE
14 years 3 months ago
2006
IEEE
- We consider and investigate a generalized signaling method for non-coherent orthogonal FH/BFSK in band multitone jamming (BMJ). We let symbol tones not be restricted within one c...