Sciweavers

9659 search results - page 290 / 1932
» Points on Computable Curves
Sort
View
ANTS
2004
Springer
121views Algorithms» more  ANTS 2004»
16 years 5 days ago
Function Field Sieve in Characteristic Three
In this paper we investigate the efficiency of the function field sieve to compute discrete logarithms in the finite fields F3n . Motivated by attacks on identity based encrypti...
Robert Granger, Andrew J. Holt, Dan Page, Nigel P....
DATE
2009
IEEE
91views Hardware» more  DATE 2009»
15 years 10 months ago
Optimizing the HW/SW boundary of an ECC SoC design using control hierarchy and distributed storage
Abstract--Hardware/Software codesign of Elliptic Curve Cryptography has been extensively studied in recent years. However, most of these designs have focused on the computational a...
Xu Guo, Patrick Schaumont
HYBRID
2000
Springer
15 years 10 months ago
Ellipsoidal Techniques for Reachability Analysis
For the reach tube of a linear time-varying system with ellipsoidal bounds on the control variable consider the following approximation problem. Find a tight ellipsoid-valued tube...
Alexander B. Kurzhanski, Pravin Varaiya
SMI
2010
IEEE
228views Image Analysis» more  SMI 2010»
15 years 5 months ago
Hierarchical Spline Approximation of the Signed Distance Function
We present a method to compute the medial axis of a smooth curve or surface by using PHT-spline (polynomial splines over hierarchical T-meshes) hierarchical approximation. In part...
Xinghua Song, Bert Jüttler, Adrien Poteaux
ICPR
2002
IEEE
16 years 7 months ago
Speeding up SVM Decision Based on Mirror Points
In this paper, we propose a new method to speed up SVM decision based on the idea of mirror points. Decisions based on multiple simple classifiers, which are formed as a result of...
Jiun-Hung Chen, Chu-Song Chen