1974 search results - page 124 / 395 » On Unbiased Linear Approximations |
164
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...
143
click to vote
ICIP
2005
IEEE
16 years 8 months ago
2005
IEEE
We provide a new comparison between hexagonal and orthogonal lattices, based on approximation theory. For each of the lattices, we select the "natural" spline basis func...
172
click to vote
FSTTCS
2004
Springer
15 years 11 months ago
2004
Springer
Abstract Abstract. In this paper we improve the analysis of approximation algorithms based on semidefinite programming for the maximum graph partitioning problems MAX-k-CUT, MAX-k...
140
Voted
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. We consider approximating the minmax value of a multiplayer game in strategic form. Tightening recent bounds by Borgs et al., we observe that approximating the value with...
192
click to vote
JMLR
2010
15 years 4 months ago
2010
Convolution kernels for trees provide simple means for learning with tree-structured data. The computation time of tree kernels is quadratic in the size of the trees, since all pa...