1647 search results - page 218 / 330 » Improved Randomized Approximation Algorithms for Lot-Sizing ... |
118
Voted
DISOPT
2008
15 years 2 months ago
2008
We define the k-path tree matroid, and use it to solve network design problems in which the required connectivity is arbitrary for a given pair of nodes, and 1 for the other pairs...
158
Voted
JMLR
2012
13 years 4 months ago
2012
We study a generalized framework for structured sparsity. It extends the well known methods of Lasso and Group Lasso by incorporating additional constraints on the variables as pa...
120
Voted
AI
1998
Springer
15 years 6 months ago
1998
Springer
Abstract. The general timetabling problem is an assignment of activities to xed time intervals, adhering to a prede ned set of resource availabilities. Timetabling problems are di ...
168
Voted
CVPR
2009
IEEE
16 years 9 months ago
2009
IEEE
Many computer vision problems can be formulated in
a Bayesian framework with Markov Random Field (MRF)
or Conditional Random Field (CRF) priors. Usually, the
model assumes that ...
110
Voted
CVPR
2006
IEEE
15 years 8 months ago
2006
IEEE
In this paper, we present a generative model based approach to solve the multi-view stereo problem. The input images are considered to be generated by either one of two processes:...