Sciweavers

2020 search results - page 108 / 404
» Speeding up Slicing
Sort
View
MOC
2000
87views more  MOC 2000»
15 years 5 months ago
Improving the parallelized Pollard lambda search on anomalous binary curves
The best algorithm known for finding logarithms on an elliptic curve (E) is the (parallelized) Pollard lambda collision search. We show how to apply a Pollard lambda search on a se...
Robert P. Gallant, Robert J. Lambert, Scott A. Van...
MOC
2002
87views more  MOC 2002»
15 years 5 months ago
On the resolution of relative Thue equations
An efficient algorithm is given for the resolution of relative Thue equations. The essential improvement is the application of an appropriate version of Wildanger's enumeratio...
István Gaál, Michael Pohst
MOC
2002
109views more  MOC 2002»
15 years 5 months ago
The parallelized Pollard kangaroo method in real quadratic function fields
Abstract. We show how to use the parallelized kangaroo method for computing invariants in real quadratic function fields. Specifically, we show how to apply the kangaroo method to ...
Andreas Stein, Edlyn Teske
TSMC
2002
119views more  TSMC 2002»
15 years 5 months ago
A cloning approach to classifier training
The Al-Alaoui algorithm is a weighted mean-square error (MSE) approach to pattern recognition. It employs cloning of the erroneously classified samples to increase the population o...
M. A. Al-Alaoui, R. Mouci, M. M. Mansour, Rony Fer...
CIARP
2010
Springer
15 years 4 months ago
Improving the Dynamic Hierarchical Compact Clustering Algorithm by Using Feature Selection
Abstract. Feature selection has improved the performance of text clustering. In this paper, a local feature selection technique is incorporated in the dynamic hierarchical compact ...
Reynaldo Gil-García, Aurora Pons-Porrata