9659 search results - page 70 / 1932 » Points on Computable Curves |
EUROCRYPT
2001
Springer
15 years 4 months ago
2001
Springer
The use of elliptic curves in cryptography relies on the ability to count the number of points on a given curve. Before 1999, the SEA algorithm was the only efficient method known ...
105
click to vote
GD
2003
Springer
15 years 5 months ago
2003
Springer
A drawing of a family of cuts of a graph is an augmented drawing of the graph such that every cut in the family is represented by a simple closed curve and vice versa. We show tha...
AUTOMATICA
2008
15 years 14 hour ago
2008
High-order repetitive control has previously been introduced to either improve the robustness for period-time uncertainty or reduce the sensitivity for non-periodic inputs of stan...
IMAMCI
2007
14 years 11 months ago
2007
In this paper, we present a geometric method for describing the effects of the delay induced uncertainty on the stability of a standard Smith Predictor control scheme. The method...
SMA
2008
ACM
14 years 11 months ago
2008
ACM
In this paper, we present a new visibility-based feature extraction algorithm from discrete models as dense point clouds resulting from laser scans. Based on the observation that ...