Sciweavers

357 search results - page 7 / 72
» Computations of class numbers of real quadratic fields
Sort
View
MOC
2000
132views more  MOC 2000»
13 years 7 months ago
Lattice computations for random numbers
We improve on a lattice algorithm of Tezuka for the computation of the k-distribution of a class of random number generators based on finite fields. We show how this is applied to ...
Raymond Couture, Pierre L'Ecuyer
TCS
1998
13 years 7 months ago
Dynamical Recognizers: Real-Time Language Recognition by Analog Computers
We consider a model of analog computation which can recognize various languages in real time. We encode an input word as a point in Rd by composing iterated maps, and then apply i...
Cristopher Moore
MOC
1998
87views more  MOC 1998»
13 years 7 months ago
Tables of unit groups and class groups of quintic fields and a regulator bound
Using a new regulator bound we determine unit groups and class groups of the 289040 quintic algebraic number fields with absolute discriminant less than 2 × 107 (totally real fi...
Michael E. Pohst, K. Wildanger
AFRICACRYPT
2008
Springer
14 years 1 months ago
An Adaptation of the NICE Cryptosystem to Real Quadratic Orders
Abstract. In 2000, Paulus and Takagi introduced a public key cryptosystem called NICE that exploits the relationship between maximal and non-maximal orders in imaginary quadratic n...
Michael J. Jacobson Jr., Renate Scheidler, Daniel ...
CVPR
2006
IEEE
14 years 9 months ago
Solving Markov Random Fields using Second Order Cone Programming Relaxations
This paper presents a generic method for solving Markov random fields (MRF) by formulating the problem of MAP estimation as 0-1 quadratic programming (QP). Though in general solvi...
M. Pawan Kumar, Philip H. S. Torr, Andrew Zisserma...