1974 search results - page 99 / 395 » On Unbiased Linear Approximations |
116
Voted
SIAMJO
2011
14 years 7 months ago
2011
In this paper we define semidefinite packing programs and describe an algorithm to approximately solve these problems. Semidefinite packing programs arise in many applications s...
168
Voted
APPROX
2011
Springer
14 years 21 days ago
2011
Springer
In this work we consider the problem of approximating the number of relevant variables in a function given query access to the function. Since obtaining a multiplicative factor ap...
112
click to vote
ICML
2005
IEEE
16 years 1 months ago
2005
IEEE
Mappings to structured output spaces (strings, trees, partitions, etc.) are typically learned using extensions of classification algorithms to simple graphical structures (eg., li...
138
Voted
ISBI
2004
IEEE
16 years 1 months ago
2004
IEEE
We present a new fast implementation of a non-rigid registration algorithm, based on a finite element elastic deformation model using the mutual information metric with a linear e...
116
Voted
SARA
2009
Springer
15 years 7 months ago
2009
Springer
MINLP problems are hard constrained optimization problems, with nonlinear constraints and mixed discrete continuous variables. They can be solved using a Branch-and-Bound scheme c...