Sciweavers

58 search results - page 1 / 12
» Two Families of Algorithms for Symbolic Polynomials
Sort
View
PKC
1998
Springer
123views Cryptology» more  PKC 1998»
13 years 8 months ago
Two Efficient Algorithms for Arithmetic of Elliptic Curves Using Frobenius Map
In this paper, we present two efficient algorithms computing scalar multiplications of a point in an elliptic curve defined over a small finite field, the Frobenius map of which ha...
Jung Hee Cheon, Sung-Mo Park, Sangwoo Park, Daeho ...
APPROX
2005
Springer
84views Algorithms» more  APPROX 2005»
13 years 10 months ago
The Tensor Product of Two Codes Is Not Necessarily Robustly Testable
There has been significant interest lately in the task of constructing codes that are testable with a small number of random probes. Ben-Sasson and Sudan show that the repeated te...
Paul Valiant
EUROGP
2001
Springer
105views Optimization» more  EUROGP 2001»
13 years 9 months ago
Adaptive Genetic Programming Applied to New and Existing Simple Regression Problems
Abstract. In this paper we continue our study on adaptive genetic programming. We use Stepwise Adaptation of Weights (saw) to boost performance of a genetic programming algorithm o...
Jeroen Eggermont, Jano I. van Hemert
CISS
2008
IEEE
13 years 11 months ago
Optimizing redundancy using MDS codes and dynamic symbol allocation in mobile ad hoc networks
—We consider the design of a network in which packet transmissions between two nodes are to be guaranteed a certain probability of success. There are N independent paths between ...
Anna Kacewicz, Stephen B. Wicker