Sciweavers

1435 search results - page 173 / 287
» Generalization Error Bounds Using Unlabeled Data
Sort
View
PKDD
2009
Springer
184views Data Mining» more  PKDD 2009»
15 years 2 months ago
Boosting Active Learning to Optimality: A Tractable Monte-Carlo, Billiard-Based Algorithm
Abstract. This paper focuses on Active Learning with a limited number of queries; in application domains such as Numerical Engineering, the size of the training set might be limite...
Philippe Rolet, Michèle Sebag, Olivier Teyt...
SIAMCO
2010
147views more  SIAMCO 2010»
14 years 8 months ago
Anytime Reliable Transmission of Real-Valued Information through Digital Noisy Channels
Abstract. The problem of reliably transmitting a real-valued random vector through a digital noisy channel is relevant for the design of distributed estimation and control techniqu...
Giacomo Como, Fabio Fagnani, Sandro Zampieri
PAMI
2011
14 years 5 months ago
Approximate Nearest Subspace Search
—Subspaces offer convenient means of representing information in many pattern recognition, machine vision, and statistical learning applications. Contrary to the growing populari...
Ronen Basri, Tal Hassner, Lihi Zelnik-Manor
85
Voted
ICCV
2003
IEEE
16 years 3 days ago
Towards Gauge Invariant Bundle Adjustment: A Solution Based on Gauge Dependent Damping
Bundle ajustment is used to obtain accurate visual reconstructions by minimizing the reprojection error. The coordinate frame ambiguity, or more generality the gauge freedoms, has...
Adrien Bartoli
77
Voted
PKDD
2009
Springer
147views Data Mining» more  PKDD 2009»
15 years 4 months ago
Kernel Polytope Faces Pursuit
Abstract. Polytope Faces Pursuit (PFP) is a greedy algorithm that approximates the sparse solutions recovered by 1 regularised least-squares (Lasso) [4,10] in a similar vein to (Or...
Tom Diethe, Zakria Hussain