Sciweavers

421 search results - page 13 / 85
» Ant algorithms
Sort
View
ANTS
2004
Springer
95views Algorithms» more  ANTS 2004»
13 years 11 months ago
Using Primitive Subgroups to Do More with Fewer Bits
Abstract. This paper gives a survey of some ways to improve the efficiency of discrete log-based cryptography by using the restriction of scalars and the geometry and arithmetic of...
Karl Rubin, Alice Silverberg
ANTS
2008
Springer
99views Algorithms» more  ANTS 2008»
13 years 9 months ago
Point Counting on Singular Hypersurfaces
We discuss how one can extend to hypersurfaces with isolated singularities the methods of Gerkmann, Abbott-Kedlaya-Roe and Lauder for counting points on smooth hypersurfaces.
Remke Kloosterman
ANTS
2008
Springer
83views Algorithms» more  ANTS 2008»
13 years 9 months ago
Enumeration of Totally Real Number Fields of Bounded Root Discriminant
We enumerate all totally real number fields F with root discriminant F 14. There are 1229 such fields, each with degree [F : Q] 9. In this article, we consider the following prob...
John Voight
ANTS
2004
Springer
97views Algorithms» more  ANTS 2004»
14 years 23 days ago
Elliptic Curves with a Given Number of Points
We present a non-archimedean method to construct, given an integer N ≥ 1, a finite field Fq and an elliptic curve E/Fq such that E(Fq) has order N.
Reinier Bröker, Peter Stevenhagen
ICIP
2006
IEEE
14 years 9 months ago
Texture Classification with Ants
In this paper, we present a novel texture classification algorithm inspired by the self-assembling behavior of real ants when building live structures with their bodies. The propo...
Arshad Hussain, Nasir Rajpoot, Kashif Rajpoot