Sciweavers

7 search results - page 1 / 2
» Nearly optimal solutions for the chow parameters problem and...
Sort
View
STOC
2012
ACM
209views Algorithms» more  STOC 2012»
11 years 11 months ago
Nearly optimal solutions for the chow parameters problem and low-weight approximation of halfspaces
The Chow parameters of a Boolean function f : {−1, 1}n → {−1, 1} are its n + 1 degree-0 and degree-1 Fourier coefficients. It has been known since 1961 [Cho61, Tan61] that ...
Anindya De, Ilias Diakonikolas, Vitaly Feldman, Ro...
ICPR
2002
IEEE
14 years 2 months ago
Near-Optimal Regularization Parameters for Applications in Computer Vision
Computer vision requires the solution of many ill-posed problems such as optical flow, structure from motion, shape from shading, surface reconstruction, image restoration and ed...
Changjiang Yang, Ramani Duraiswami, Larry S. Davis
FOCS
2008
IEEE
14 years 3 months ago
Near-Optimal Sparse Recovery in the L1 Norm
Abstract— We consider the approximate sparse recovery problem, where the goal is to (approximately) recover a highdimensional vector x ∈ Rn from its lower-dimensional sketch Ax...
Piotr Indyk, Milan Ruzic
ICML
2010
IEEE
13 years 10 months ago
Boosting Classifiers with Tightened L0-Relaxation Penalties
We propose a novel boosting algorithm which improves on current algorithms for weighted voting classification by striking a better balance between classification accuracy and the ...
Noam Goldberg, Jonathan Eckstein
SWAT
2004
Springer
109views Algorithms» more  SWAT 2004»
14 years 2 months ago
Robust Subgraphs for Trees and Paths
Consider a graph problem which is associated with a parameter, for example, that of finding a longest tour spanning k vertices. The following question is natural: Is there a smal...
Refael Hassin, Danny Segev