480 search results - page 38 / 96 » Approximate and exact algorithms for the fixed-charge knapsa... |
COMPGEOM
2004
ACM
14 years 2 months ago
2004
ACM
We present a novel Locality-Sensitive Hashing scheme for the Approximate Nearest Neighbor Problem under ÐÔ norm, based on Ôstable distributions. Our scheme improves the running...
WAOA
2005
Springer
14 years 2 months ago
2005
Springer
Given a graph with a source and a sink node, the NP–hard maximum k–splittable flow (MkSF) problem is to find a flow of maximum value with a flow decomposition using at most...
CEC
2007
IEEE
14 years 1 months ago
2007
IEEE
This paper presents an approach for constructing improved visual representations of high dimensional objective spaces using virtual reality. These spaces arise from the solution of...
IJAR
2006
13 years 9 months ago
2006
Although influence diagrams are powerful tools for representing and solving complex decisionmaking problems, their evaluation may require an enormous computational effort and this...
IJCV
2011
13 years 4 months ago
2011
This paper is devoted to the optimization problem of continuous multipartitioning, or multi-labeling, which is based on a convex relaxation of the continuous Potts model. In contr...