3894 search results - page 161 / 779 » Approximation Algorithms for Biclustering Problems |
186
click to vote
ECCC
2008
15 years 6 months ago
2008
We construct public-key cryptosystems that are secure assuming the worst-case hardness of approximating the minimum distance on n-dimensional lattices to within small poly(n) fact...
177
click to vote
HICSS
2008
IEEE
16 years 28 days ago
2008
IEEE
A technique for clustering data by common attribute values involves grouping rows and columns of a binary matrix to make the minimum number of submatrices all 1’s. As binary mat...
155
click to vote
INFORMS
2008
15 years 6 months ago
2008
We propose an exact solution method for a routing and capacity installation problem in networks. Given an input graph, the problem is to route traffic from a set of source nodes t...
168
click to vote
ICPR
2008
IEEE
16 years 27 days ago
2008
IEEE
We have considered a problem of continuous piecewise linear approximation of the digital curves with a minimum number of the line segments. Fast suboptimal algorithm for constrain...
176
click to vote
ICALP
2001
Springer
15 years 11 months ago
2001
Springer
Abstract. We consider the scheduling problem of minimizing the average weighted job completion time on a single machine under precedence constraints. We show that this problem with...