218 search results - page 34 / 44 » Strong Bounds Consistencies and Their Application to Linear ... |
165
click to vote
CORR
2011
Springer
14 years 9 months ago
2011
Springer
Consider a linear [n, k, d]q code C. We say that that i-th coordinate of C has locality r, if the value at this coordinate can be recovered from accessing some other r coordinates...
169
click to vote
SODA
2010
ACM
16 years 3 months ago
2010
ACM
We introduce the classified stable matching problem, a problem motivated by academic hiring. Suppose that a number of institutes are hiring faculty members from a pool of applican...
275
Voted
SIAMIS
2011
15 years 1 months ago
2011
The convergence rate is analyzed for the sparse reconstruction by separable approximation (SpaRSA) algorithm for minimizing a sum f(x) + ψ(x), where f is smooth and ψ is convex, ...
158
click to vote
COLT
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. The classical perceptron algorithm is an elementary algorithm for solving a homogeneous linear inequality system Ax > 0, with many important applications in learning t...
163
click to vote
MP
2006
15 years 6 months ago
2006
Mixed integer programming (MIP) formulations are typically tightened through the use of a separation algorithm and the addition of violated cuts. Using extended formulations involv...