151 search results - page 23 / 31 » Constrained Ordinal Optimization - A Feasibility Model Based... |
KDD
2010
ACM
13 years 9 months ago
2010
ACM
We consider the problem of learning incoherent sparse and lowrank patterns from multiple tasks. Our approach is based on a linear multi-task learning formulation, in which the spa...
COR
2008
13 years 7 months ago
2008
In this paper we discuss models and methods for solving the rooted distance constrained minimum spanning tree problem which is defined as follows: given a graph G = (V, E) with no...
COLT
2006
Springer
13 years 11 months ago
2006
Springer
In an online convex optimization problem a decision-maker makes a sequence of decisions, i.e., chooses a sequence of points in Euclidean space, from a fixed feasible set. After ea...
CCO
2001
Springer
14 years 5 hour ago
2001
Springer
Abstract. We study in this lecture the literature on mixed integer programming models and formulations for a specific problem class, namely deterministic production planning probl...
CVPR
2012
IEEE
11 years 10 months ago
2012
IEEE
We study unsupervised learning of occluding objects in images of visual scenes. The derived learning algorithm is based on a probabilistic generative model which parameterizes obj...