3894 search results - page 487 / 779 » Approximation Algorithms for Biclustering Problems |
181
click to vote
SODA
2010
ACM
16 years 1 months ago
2010
ACM
Bidimensionality theory appears to be a powerful framework in the development of meta-algorithmic techniques. It was introduced by Demaine et al. [J. ACM 2005 ] as a tool to obtai...
142
click to vote
AAAI
2012
13 years 6 months ago
2012
Widespread accounts of the harmful effects of invasive species have stimulated both practical and theoretical studies on how the spread of these destructive agents can be containe...
132
click to vote
STOC
2007
ACM
16 years 4 months ago
2007
ACM
We demonstrate an average-case problem that is as hard as finding (n)-approximate shortest vectors in certain n-dimensional lattices in the worst case, where (n) = O( log n). The...
122
click to vote
ICML
2005
IEEE
16 years 5 months ago
2005
IEEE
Low-rank matrix decompositions are essential tools in the application of kernel methods to large-scale learning problems. These decompositions have generally been treated as black...
116
click to vote
STOC
2004
ACM
16 years 4 months ago
2004
ACM
A flow is said to be confluent if at any node all the flow leaves along a single edge. Given a directed graph G with k sinks and non-negative demands on all the nodes of G, we con...