96 search results - page 15 / 20 » Approximating the maximum quadratic assignment problem |
ICALP
2003
Springer
14 years 1 months ago
2003
Springer
We consider requests for capacity in a given tree network T = (V, E) where each edge of the tree has some integer capacity ue. Each request consists of an integer demand df and a ...
FOCS
2009
IEEE
14 years 3 months ago
2009
IEEE
We consider the Item Pricing problem for revenue maximization in the limited supply setting, where a single seller with n items caters to m buyers with unknown subadditive valuati...
COLT
2003
Springer
14 years 1 months ago
2003
Springer
We propose a new formulation of the clustering problem that differs from previous work in several aspects. First, the goal is to explicitly output a collection of simple and meani...
CVPR
2009
IEEE
15 years 3 months ago
2009
IEEE
The accurate localization of facial features plays a fundamental
role in any face recognition pipeline. Constrained
local models (CLM) provide an effective approach to localizati...
ICARCV
2008
IEEE
14 years 3 months ago
2008
IEEE
— We consider a discrete-time dynamical system with Boolean and continuous states, with the continuous state propagating linearly in the continuous and Boolean state variables, a...