3874 search results - page 152 / 775 » Approximation Algorithms for k-hurdle Problems |
105
click to vote
CORR
2004
Springer
15 years 1 months ago
2004
Springer
Sorting by reversals is an important problem in inferring the evolutionary relationship between two genomes. The problem of sorting unsigned permutation has been proven to be NP-ha...
121
click to vote
FOCS
2004
IEEE
15 years 5 months ago
2004
IEEE
Edit distance has been extensively studied for the past several years. Nevertheless, no linear-time algorithm is known to compute the edit distance between two strings, or even to...
117
Voted
COCOON
2006
Springer
15 years 5 months ago
2006
Springer
In this paper we present approximation results for the class constrained bin packing problem that has applications to Video-on-Demand Systems. In this problem we are given bins of...
125
Voted
ECCC
2008
15 years 1 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...
119
click to vote
HICSS
2008
IEEE
15 years 8 months 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...