7 search results - page 1 / 2 » Nearly optimal solutions for the chow parameters problem and... |
STOC
2012
ACM
12 years 1 days ago
2012
ACM
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 ...
ICPR
2002
IEEE
14 years 2 months ago
2002
IEEE
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...
FOCS
2008
IEEE
14 years 4 months ago
2008
IEEE
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...
ICML
2010
IEEE
13 years 10 months ago
2010
IEEE
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 ...
SWAT
2004
Springer
14 years 2 months ago
2004
Springer
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...