Sciweavers

539 search results - page 56 / 108
» Linear complexity of transformed sequences
Sort
View
JCSS
2002
95views more  JCSS 2002»
14 years 9 months ago
Efficient algorithms for multichromosomal genome rearrangements
Hannenhalli and Pevzner [5] gave a polynomial time algorithm for computing the minimum number of reversals, translocations, fissions, and fusions, that would transform one multichr...
Glenn Tesler
PAIRING
2007
Springer
140views Cryptology» more  PAIRING 2007»
15 years 3 months ago
The Tate Pairing Via Elliptic Nets
We derive a new algorithm for computing the Tate pairing on an elliptic curve over a finite field. The algorithm uses a generalisation of elliptic divisibility sequences known as...
Katherine E. Stange
IJNSEC
2007
128views more  IJNSEC 2007»
14 years 9 months ago
LFSR-based Signatures with Message Recovery
In order to reduce key sizes and bandwidth, several LFSRbased (linear feedback shift register) public key cryptosystems and signature schemes have been proposed. Digital signature...
Xiangxue Li, Dong Zheng, Kefei Chen
AMFG
2003
IEEE
118views Biometrics» more  AMFG 2003»
15 years 3 months ago
Shape and appearance models of talking faces for model-based tracking
This article presents a system that can recover and track the 3D speech movements of a speaker’s face for each image of a monocular sequence. A speaker-specific face model is u...
Matthias Odisio, Gérard Bailly
CORR
2010
Springer
142views Education» more  CORR 2010»
14 years 6 months ago
Constructions of Optical Queues With a Limited Number of Recirculations--Part I: Greedy Constructions
One of the main problems in all-optical packet-switched networks is the lack of optical buffers, and one feasible technology for the constructions of optical buffers is to use opt...
Jay Cheng, Cheng-Shang Chang, Sheng-Hua Yang, Tsz-...