Sciweavers

7015 search results - page 8 / 1403
» Approximation algorithms for co-clustering
Sort
View
IACR
2011
141views more  IACR 2011»
12 years 7 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
SODA
2012
ACM
240views Algorithms» more  SODA 2012»
11 years 10 months ago
Simultaneous approximations for adversarial and stochastic online budgeted allocation
Motivated by online ad allocation, we study the problem of simultaneous approximations for the adversarial and stochastic online budgeted allocation problem. This problem consists...
Vahab S. Mirrokni, Shayan Oveis Gharan, Morteza Za...
COMPGEOM
2011
ACM
12 years 11 months ago
Deconstructing approximate offsets
We consider the offset-deconstruction problem: Given a polygonal shape Q with n vertices, can it be expressed, up to a tolerance ε in Hausdorff distance, as the Minkowski sum o...
Eric Berberich, Dan Halperin, Michael Kerber, Roza...
CODCRY
2011
Springer
247views Cryptology» more  CODCRY 2011»
12 years 11 months ago
List Decoding for Binary Goppa Codes
This paper presents a list-decoding algorithm for classical irreducible binary Goppa codes. The algorithm corrects, in polynomial time, approximately n − p n(n − 2t − 2) err...
Daniel J. Bernstein
IPL
2006
151views more  IPL 2006»
13 years 7 months ago
Approximating weighted matchings in parallel
We present an NC approximation algorithm for the weighted matching problem in graphs with an approximation ratio of (1 - ). This improves the previously best approximation ratio of...
Stefan Hougardy, Doratha E. Drake Vinkemeier