Sciweavers

116 search results - page 17 / 24
» Learning Implied Global Constraints
Sort
View
CORR
2011
Springer
215views Education» more  CORR 2011»
13 years 5 days ago
Lasserre Hierarchy, Higher Eigenvalues, and Approximation Schemes for Quadratic Integer Programming with PSD Objectives
We present an approximation scheme for optimizing certain Quadratic Integer Programming problems with positive semidefinite objective functions and global linear constraints. Thi...
Venkatesan Guruswami, Ali Kemal Sinop
CP
2009
Springer
14 years 3 months ago
Why Cumulative Decomposition Is Not as Bad as It Sounds
Abstract. The global cumulative constraint was proposed for modelling cumulative resources in scheduling problems for finite domain (FD) propagation. Since that time a great deal ...
Andreas Schutt, Thibaut Feydy, Peter J. Stuckey, M...
CVPR
2012
IEEE
11 years 11 months ago
Contextual Boost for Pedestrian Detection
Pedestrian detection from images is an important and yet challenging task. The conventional methods usually identify human figures using image features inside the local regions. In...
Yuanyuan Ding, Jing Xiao
KDD
2010
ACM
245views Data Mining» more  KDD 2010»
13 years 10 months ago
Learning incoherent sparse and low-rank patterns from multiple tasks
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...
Jianhui Chen, Ji Liu, Jieping Ye
EMMCVPR
2005
Springer
14 years 1 months ago
Reverse-Convex Programming for Sparse Image Codes
Abstract. Reverse-convex programming (RCP) concerns global optimization of a specific class of non-convex optimization problems. We show that a recently proposed model for sparse ...
Matthias Heiler, Christoph Schnörr