Sciweavers

52 search results - page 5 / 11
» Algebraic fingerprints for faster algorithms
Sort
View
ICCV
2011
IEEE
14 years 6 months ago
Optimizing Polynomial Solvers for Minimal Geometry Problems
In recent years polynomial solvers based on algebraic geometry techniques, and specifically the action matrix method, have become popular for solving minimal problems in computer...
Oleg Naroditsky, Kostas Daniilidis
ASIACRYPT
2001
Springer
15 years 9 months ago
Efficient Traitor Tracing Algorithms Using List Decoding
Abstract. We use powerful new techniques for list decoding errorcorrecting codes to efficiently trace traitors. Although much work has focused on constructing traceability schemes,...
Alice Silverberg, Jessica Staddon, Judy L. Walker
AIPS
2008
15 years 8 months ago
Efficient ADD Operations for Point-Based Algorithms
During the past few years, point-based POMDP solvers have gradually scaled up to handle medium sized domains through better selection of the set of points and efficient backup met...
Guy Shani, Pascal Poupart, Ronen I. Brafman, Solom...
CORR
2010
Springer
131views Education» more  CORR 2010»
15 years 4 months ago
Ideal forms of Coppersmith's theorem and Guruswami-Sudan list decoding
: We develop a framework for solving polynomial equations with size constraints on solutions. We obtain our results by showing how to apply a technique of Coppersmith for finding ...
Henry Cohn, Nadia Heninger
ISSAC
2004
Springer
159views Mathematics» more  ISSAC 2004»
15 years 11 months ago
Complexity issues in bivariate polynomial factorization
Many polynomial factorization algorithms rely on Hensel lifting and factor recombination. For bivariate polynomials we show that lifting the factors up to a precision linear in th...
Alin Bostan, Grégoire Lecerf, Bruno Salvy, ...