Sciweavers

6045 search results - page 388 / 1209
» Computable Linearizations of Well-partial-orderings
Sort
View
DAM
1998
88views more  DAM 1998»
15 years 7 months ago
Neither Reading Few Bits Twice Nor Reading Illegally Helps Much
We first consider so-called (1,+s)-branching programs in which along every consistent path at most s variables are tested more than once. We prove that any such program computing...
Stasys Jukna, Alexander A. Razborov
ML
2002
ACM
127views Machine Learning» more  ML 2002»
15 years 7 months ago
Sparse Regression Ensembles in Infinite and Finite Hypothesis Spaces
We examine methods for constructing regression ensembles based on a linear program (LP). The ensemble regression function consists of linear combinations of base hypotheses generat...
Gunnar Rätsch, Ayhan Demiriz, Kristin P. Benn...
ET
2010
89views more  ET 2010»
15 years 6 months ago
On the Duality of Probing and Fault Attacks
In this work we investigate the problem of simultaneous privacy and integrity protection in cryptographic circuits. We consider a white-box scenario with a powerful, yet limited at...
Berndt M. Gammel, Stefan Mangard
MP
2010
94views more  MP 2010»
15 years 6 months ago
MIR closures of polyhedral sets
We study the mixed-integer rounding (MIR) closures of polyhedral sets. The MIR closure of a polyhedral set is equal to its split closure and the associated separation problem is N...
Sanjeeb Dash, Oktay Günlük, Andrea Lodi
505
Voted
PRL
2010
310views more  PRL 2010»
15 years 6 months ago
A Lagrangian Half-Quadratic approach to robust estimation and its applications to road scene analysis
We consider the problem of fitting linearly parameterized models, that arises in many computer vision problems such as road scene analysis. Data extracted from images usually cont...
Jean-Philippe Tarel, Pierre Charbonnier