3894 search results - page 385 / 779 » Approximation Algorithms for Biclustering Problems |
108
Voted
NIPS
2003
15 years 6 months ago
2003
This paper addresses the problem of untangling hidden graphs from a set of noisy detections of undirected edges. We present a model of the generation of the observed graph that in...
148
click to vote
IEEECIT
2009
IEEE
15 years 11 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. ...
184
click to vote
JMLR
2012
13 years 7 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...
145
Voted
COLT
2000
Springer
15 years 9 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...
133
Voted
CP
2006
Springer
15 years 8 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,...