3221 search results - page 548 / 645 » Termination of Linear Programs |
162
click to vote
NIPS
2008
15 years 7 months ago
2008
We propose a new class of consistency constraints for Linear Programming (LP) relaxations for finding the most probable (MAP) configuration in graphical models. Usual cluster-base...
164
click to vote
NIPS
2008
15 years 7 months ago
2008
We consider the problem of multiple kernel learning (MKL), which can be formulated as a convex-concave problem. In the past, two efficient methods, i.e., Semi-Infinite Linear Prog...
168
click to vote
NIPS
2008
15 years 7 months ago
2008
We consider the problem of obtaining the approximate maximum a posteriori estimate of a discrete random field characterized by pairwise potentials that form a truncated convex mod...
184
click to vote
NETWORKING
2007
15 years 7 months ago
2007
Abstract. The topology creation is one of the most important step for the design of an overlay network. Traffic characteristic and volume, and behavior of nodes which can be sel...
136
click to vote
SODA
2008
ACM
15 years 7 months ago
2008
ACM
In this paper, we study an online make-to-order variant of the classical joint replenishment problem (JRP) that has been studied extensively over the years and plays a fundamental...