3894 search results - page 509 / 779 » Approximation Algorithms for Biclustering Problems |
151
click to vote
TCS
2010
15 years 2 months ago
2010
The Correlation Clustering problem, also known as the Cluster Editing problem, seeks to edit a given graph by adding and deleting edges to obtain a collection of disconnected cliq...
127
click to vote
WADS
1997
Springer
15 years 8 months ago
1997
Springer
We consider the problem of removing a given disk from a collection of unit disks in the plane. At each step, we allow a disk to be removed by a collision-free translation to infin...
140
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
Bidimensionality theory appears to be a powerful framework for the development of metaalgorithmic techniques. It was introduced by Demaine et al. [J. ACM 2005 ] as a tool to obtai...
216
click to vote
POPL
2003
ACM
16 years 4 months ago
2003
ACM
We present a generic aproach to the static analysis of concurrent programs with procedures. We model programs as communicating pushdown systems. It is known that typical dataflow ...
211
click to vote
SIGMOD
2005
ACM
16 years 4 months ago
2005
ACM
Statistical estimation and approximate query processing have become increasingly prevalent applications for database systems. However, approximation is usually of little use witho...