Sciweavers

5019 search results - page 55 / 1004
» Computing in Quotient Groups
Sort
View
CHES
2003
Springer
119views Cryptology» more  CHES 2003»
15 years 11 months ago
Faster Double-Size Modular Multiplication from Euclidean Multipliers
Abstract. A novel technique for computing a 2n-bit modular multiplication using n-bit arithmetic was introduced at CHES 2002 by Fischer and Seifert. Their technique makes use of an...
Benoît Chevallier-Mames, Marc Joye, Pascal P...
CAV
2001
Springer
83views Hardware» more  CAV 2001»
15 years 10 months ago
Iterating Transducers
Regular languages have proved useful for the symbolic state exploration of infinite state systems. They can be used to represent infinite sets of system configurations; the tran...
Dennis Dams, Yassine Lakhnech, Martin Steffen
SAS
1999
Springer
116views Formal Methods» more  SAS 1999»
15 years 10 months ago
Decomposing Non-redundant Sharing by Complementation
Complementation, the inverse of the reduced product operation, is a technique for systemfinding minimal decompositions of abstract domains. Fil´e and Ranzato advanced the state ...
Enea Zaffanella, Patricia M. Hill, Roberto Bagnara
DCC
2010
IEEE
15 years 6 months ago
On linear sets on a projective line
Linear sets generalise the concept of subgeometries in a projective space. They have many applications in finite geometry. In this paper we address two problems for linear sets: t...
Michel Lavrauw, Geertrui Van de Voorde
PRL
2008
101views more  PRL 2008»
15 years 4 months ago
Illumination-robust face recognition using ridge regressive bilinear models
The performance of face recognition is greatly affected by illumination changes because intra-person variation of the captured images under different lighting conditions can be mu...
Dongsoo Shin, Hyung-Soo Lee, Daijin Kim