3475 search results - page 144 / 695 » Backbones in Optimization and Approximation |
185
click to vote
MIA
2010
15 years 1 months ago
2010
We propose a framework for intensity-based registration of images by linear transformations, based on a discrete Markov Random Field (MRF) formulation. Here, the challenge arises ...
169
click to vote
ALENEX
2001
15 years 7 months ago
2001
Abstract. We present a generic package for resource constrained network optimization problems. We illustrate the flexibility and the use of our package by solving four applications...
158
click to vote
ACL
1994
15 years 7 months ago
1994
The computational lexicalization of a grammar is the optimization of the links between lexicalized rules and lexical items in order to improve the quality of the bottom-up filteri...
184
click to vote
SIAMJO
2010
15 years 1 months ago
2010
We study the problem of minimizing the expected loss of a linear predictor while constraining its sparsity, i.e., bounding the number of features used by the predictor. While the r...
167
click to vote
APPROX
2005
Springer
15 years 12 months ago
2005
Springer
A large class of stochastic optimization problems can be modeled as minimizing an objective function f that depends on a choice of a vector x ∈ X, as well as on a random external...