Sciweavers

1435 search results - page 284 / 287
» Generalization Error Bounds Using Unlabeled Data
Sort
View
SIAMCO
2008
108views more  SIAMCO 2008»
13 years 7 months ago
A Viability Theorem for Morphological Inclusions
The aim of this paper is to adapt the Viability Theorem from differential inclusions (governing the evolution of vectors in a finite dimensional space) to so-called morphological i...
Thomas Lorenz
CORR
2011
Springer
186views Education» more  CORR 2011»
12 years 11 months ago
Blind Compressed Sensing Over a Structured Union of Subspaces
—This paper addresses the problem of simultaneous signal recovery and dictionary learning based on compressive measurements. Multiple signals are analyzed jointly, with multiple ...
Jorge Silva, Minhua Chen, Yonina C. Eldar, Guiller...
PPOPP
2012
ACM
12 years 2 months ago
A speculation-friendly binary search tree
We introduce the first binary search tree algorithm designed for speculative executions. Prior to this work, tree structures were mainly designed for their pessimistic (non-specu...
Tyler Crain, Vincent Gramoli, Michel Raynal
CVPR
2009
IEEE
1351views Computer Vision» more  CVPR 2009»
15 years 2 months ago
Support Vector Machines in Face Recognition with Occlusions
Support Vector Machines (SVM) are one of the most useful techniques in classification problems. One clear example is face recognition. However, SVM cannot be applied when the fe...
Aleix M. Martínez, Hongjun Jia
ICCV
2007
IEEE
14 years 9 months ago
Gradient Feature Selection for Online Boosting
Boosting has been widely applied in computer vision, especially after Viola and Jones's seminal work [23]. The marriage of rectangular features and integral-imageenabled fast...
Ting Yu, Xiaoming Liu 0002