3875 search results - page 411 / 775 » Approximation algorithms for the 0-extension problem |
196
click to vote
IEEECIT
2009
IEEE
16 years 1 months ago
2009
IEEE
—Software clustering is a method for increasing software system understanding and maintenance. Software designers, first use MDG graph to model the structure of software system. ...
203
click to vote
TCBB
2011
15 years 1 months ago
2011
—We study the problem of merging genetic maps, when the individual genetic maps are given as directed acyclic graphs. The computational problem is to build a consensus map, which...
230
Voted
JMLR
2012
13 years 9 months ago
2012
We study a generalized framework for structured sparsity. It extends the well known methods of Lasso and Group Lasso by incorporating additional constraints on the variables as pa...
182
click to vote
COLT
2000
Springer
15 years 11 months ago
2000
Springer
We investigate the computational complexity of the task of detecting dense regions of an unknown distribution from un-labeled samples of this distribution. We introduce a formal l...
171
click to vote
CP
2006
Springer
15 years 10 months ago
2006
Springer
Many important combinatorial optimization problems can be expressed as constraint satisfaction problems with soft constraints. When problems are too difficult to be solved exactly,...