Sciweavers

79 search results - page 2 / 16
» Hardware-Based Implementation of the Common Approximate Subs...
Sort
View
IACR
2011
141views more  IACR 2011»
12 years 5 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
APPROX
2006
Springer
126views Algorithms» more  APPROX 2006»
13 years 10 months ago
Better Approximations for the Minimum Common Integer Partition Problem
Abstract. In the k-Minimum Common Integer Partition Problem, abbreviated k-MCIP, we are given k multisets X1, . . . , Xk of positive integers, and the goal is to find an integer mu...
David P. Woodruff
IPPS
2006
IEEE
14 years 8 days ago
Implementation of a programmable array processor architecture for approximate string matching algorithms on FPGAs
Approximate string matching problem is a common and often repeated task in information retrieval and bioinformatics. This paper proposes a generic design of a programmable array p...
Panagiotis D. Michailidis, Konstantinos G. Margari...
SWAT
2004
Springer
98views Algorithms» more  SWAT 2004»
13 years 11 months ago
Tight Approximability Results for Test Set Problems in Bioinformatics
In this paper, we investigate the test set problem and its variations that appear in a variety of applications. In general, we are given a universe of objects to be “distinguish...
Piotr Berman, Bhaskar DasGupta, Ming-Yang Kao
ATAL
2007
Springer
14 years 12 days ago
Implementing the maximum of monotone algorithms
Running several sub-optimal algorithms and choosing the optimal one is a common procedure in computer science, most notably in the design of approximation algorithms. This paper d...
Liad Blumrosen