329 search results - page 23 / 66 » Uniform variable splitting |
CVPR
2010
IEEE
15 years 8 months ago
2010
IEEE
Graph cuts methods are at the core of many state-of-theart algorithms in computer vision due to their efficiency in computing globally optimal solutions. In this paper, we solve t...
EVOW
2007
Springer
15 years 6 months ago
2007
Springer
In this paper we study a complex real-world workforce scheduling problem. We propose a method of splitting the problem into smaller parts and solving each part using exhaustive sea...
132
click to vote
INFOCOM
1997
IEEE
15 years 4 months ago
1997
IEEE
The CARMA-NTG protocol is presented and analyzed. CARMA-NTG dynamically divides the channel into cycles of variable length; each cycle consists of a contention period and a group-...
117
click to vote
FLAIRS
2004
15 years 1 months ago
2004
A distributed search algorithm for solving distributed constraint satisfaction problems (DisCSPs) is presented. The proposed algorithm is composed of multiple search processes (SP...
117
click to vote
CORR
2011
Springer
14 years 6 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...