Sciweavers

2397 search results - page 29 / 480
» Applications of integer relation algorithms
Sort
View
STOC
2009
ACM
172views Algorithms» more  STOC 2009»
14 years 11 months ago
Linear time approximation schemes for the Gale-Berlekamp game and related minimization problems
We design a linear time approximation scheme for the GaleBerlekamp Switching Game and generalize it to a wider class of dense fragile minimization problems including the Nearest C...
Marek Karpinski, Warren Schudy
ESA
1998
Springer
145views Algorithms» more  ESA 1998»
14 years 3 months ago
Moving-Target TSP and Related Problems
Previous literature on the Traveling Salesman Problem (TSP) assumed that the sites to be visited are stationary. Motivated by practical applications, we introduce a time-dependent ...
Christopher S. Helvig, Gabriel Robins, Alexander Z...
LATIN
2010
Springer
14 years 5 months ago
Gradual Sub-lattice Reduction and a New Complexity for Factoring Polynomials
We present a lattice algorithm specifically designed for some classical applications of lattice reduction. The applications are for lattice bases with a generalized knapsack-type ...
Mark van Hoeij, Andrew Novocin
CAV
2010
Springer
214views Hardware» more  CAV 2010»
14 years 2 months ago
Comfusy: A Tool for Complete Functional Synthesis
Synthesis of program fragments from specifications can make programs easier to write and easier to reason about. We present Comfusy, a tool that extends the compiler for the gener...
Viktor Kuncak, Mikaël Mayer, Ruzica Piskac, P...
JCM
2006
78views more  JCM 2006»
13 years 11 months ago
Computationally-Efficient DNLMS-Based Adaptive Algorithms for Echo Cancellation Application
This paper investigates the application of the delayed normalized least mean square (DNLMS) algorithm to echo cancellation. In order to reduce the amount of computations, DNLMS is ...
Raymond Lee, Esam Abdel-Raheem, Mohammed A. S. Kha...