413 search results - page 16 / 83 » Computing and Exploiting Tree-Decompositions for Solving Con... |
109
click to vote
TPDS
2008
15 years 1 months ago
2008
This paper proposes a new methodology to model the distribution of finite size content to a group of users connected through an overlay network. Our methodology describes the distr...
120
click to vote
IPCO
2008
15 years 2 months ago
2008
Orbital branching is a method for branching on variables in integer programming that reduces the likelihood of evaluating redundant, isomorphic nodes in the branch-and-bound proce...
102
click to vote
SIAMJO
2000
15 years 1 months ago
2000
Abstract. Despite the efficiency shown by interior-point methods in large-scale linear programming, they usually perform poorly when applied to multicommodity flow problems. The ne...
137
click to vote
CORR
2011
Springer
14 years 8 months ago
2011
Springer
We consider a class of learning problems regularized by a structured sparsity-inducing norm defined as the sum of 2- or ∞-norms over groups of variables. Whereas much effort ha...
120
click to vote
ICCV
2003
IEEE
16 years 3 months ago
2003
IEEE
We present a new approach to 3D scene modeling based on geometric constraints. Contrary to the existing methods, we can quickly obtain 3D scene models that respect the given const...