Sciweavers

524 search results - page 17 / 105
» ets 2010
Sort
View
ICS
2010
Tsinghua U.
14 years 4 months ago
Distribution-Specific Agnostic Boosting
We consider the problem of boosting the accuracy of weak learning algorithms in the agnostic learning framework of Haussler (1992) and Kearns et al. (1992). Known algorithms for t...
Vitaly Feldman
CORR
2010
Springer
146views Education» more  CORR 2010»
13 years 7 months ago
Abstract Fixpoint Computations with Numerical Acceleration Methods
Fixpoint Computations with Numerical Acceleration Methods Olivier Bouissou1 , Yassamine Seladji1 CEA, LIST, Laboratory for the Modeling and Analysis of Interacting Systems 91191 Gi...
Olivier Bouissou, Yassamine Seladji, Alexandre Cha...
CORR
2010
Springer
81views Education» more  CORR 2010»
13 years 7 months ago
On the size of identifying codes in triangle-free graphs
In an undirected graph G = (V, E), a subset C V such that C is a dominating set of G, and each vertex in V is dominated by a distinct subset of vertices from C, is called an iden...
Florent Foucaud, Ralf Klasing, Adrian Kosowski, An...
FOCM
2010
82views more  FOCM 2010»
13 years 6 months ago
Stability and Instance Optimality for Gaussian Measurements in Compressed Sensing
In compressed sensing we seek to gain information about vector x ∈ RN from d << N nonadaptive linear measurements. Candes, Donoho, Tao et. al. ( see e.g. [2, 4, 8]) propos...
P. Wojtaszczyk
IR
2010
13 years 4 months ago
Efficient algorithms for ranking with SVMs
RankSVM (Herbrich et al, 2000; Joachims, 2002) is a pairwise method for designing ranking models. SVMLight is the only publicly available software for RankSVM. It is slow and, due ...
Olivier Chapelle, S. Sathiya Keerthi