Sciweavers

9736 search results - page 43 / 1948
» How Fast Can We Compute Products
Sort
View
CTRSA
2003
Springer
130views Cryptology» more  CTRSA 2003»
15 years 9 months ago
Fast Elliptic Curve Arithmetic and Improved Weil Pairing Evaluation
We present an algorithm which speeds scalar multiplication on a general elliptic curve by an estimated 3.8% to 8.5% over the best known general methods when using affine coordinate...
Kirsten Eisenträger, Kristin Lauter, Peter L....
ICPR
2008
IEEE
15 years 11 months ago
A fast revised simplex method for SVM training
Active set methods for training the Support Vector Machines (SVM) are advantageous since they enable incremental training and, as we show in this research, do not exhibit exponent...
Christopher Sentelle, Georgios C. Anagnostopoulos,...
RT
1998
Springer
15 years 8 months ago
Canned Lightsources
Complex luminaries and lamp geometries can greatly increase the realism of synthetic images. Unfortunately, the correct rendering of illumination from complex lamps requires costly...
Wolfgang Heidrich, Jan Kautz, Philipp Slusallek, H...
EJC
2010
15 years 4 months ago
On loop identities that can be obtained by a nuclear identification
We start by describing all the varieties of loops Q that can be defined by autotopisms x, x Q, where x is a composition of two triples, each of which becomes an autotopism when th...
Ales Drápal, Premysl Jedlicka
SAFECOMP
2005
Springer
15 years 10 months ago
Are High-Level Languages Suitable for Robust Telecoms Software?
In the telecommunications sector product development must minimise time to market while delivering high levels of dependability, availability, maintainability and scalability. High...
Jan Henry Nyström, Philip W. Trinder, David J...