Sciweavers

5595 search results - page 245 / 1119
» Approximation Algorithms for Clustering Problems
Sort
View
IACR
2011
141views more  IACR 2011»
14 years 6 months ago
Approximate common divisors via lattices
We analyze the multivariate generalization of Howgrave-Graham’s algorithm for the approximate common divisor problem. In the m-variable case with modulus N and approximate common...
Henry Cohn, Nadia Heninger
JCDL
2006
ACM
172views Education» more  JCDL 2006»
16 years 11 days ago
A comprehensive comparison study of document clustering for a biomedical digital library MEDLINE
Document clustering has been used for better document retrieval, document browsing, and text mining in digital library. In this paper, we perform a comprehensive comparison study ...
Illhoi Yoo, Xiaohua Hu
SIAMJO
2011
15 years 24 days ago
Approximating Semidefinite Packing Programs
In this paper we define semidefinite packing programs and describe an algorithm to approximately solve these problems. Semidefinite packing programs arise in many applications s...
Garud Iyengar, David J. Phillips, Clifford Stein
CORR
2004
Springer
168views Education» more  CORR 2004»
15 years 6 months ago
Estimating Genome Reversal Distance by Genetic Algorithm
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...
Andy Auyeung, Ajith Abraham
175
Voted
FOCS
2004
IEEE
15 years 10 months ago
Approximating Edit Distance Efficiently
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...
Ziv Bar-Yossef, T. S. Jayram, Robert Krauthgamer, ...