Sciweavers

237 search results - page 31 / 48
» Algorithms for Exponentiation in Finite Fields
Sort
View
IJNSEC
2010
105views more  IJNSEC 2010»
14 years 11 months ago
A Note on the Constructions of Orthomorphic Permutations
Orthomorphic permutations have important applications in the design of block ciphers. A practical algorithm is derived to generate all orthomorphic permutations over Fm 2 , and it...
Jianqin Zhou
SKG
2006
IEEE
15 years 10 months ago
Hierarchical Multicast Tree Algorithms of Data Grid
Data Grid is one of the important research subjects in the field of Grid Computing. To get a high efficiency of the system, this paper proposes a set of novel multicast algorithms...
Weijia Jia, Qingfeng Fan, Qiongli Wu, Yanxiang He
ICIP
2006
IEEE
16 years 6 months ago
Distributed Acquisition and Image Super-Resolution Based on Continuous Moments from Samples
Recently, new sampling schemes were presented for signals with finite rate of innovation (FRI) using sampling kernels reproducing polynomials or exponentials [1] [2]. In this pape...
Loïc Baboulaz, Pier Luigi Dragotti
WIA
2004
Springer
15 years 9 months ago
Brute Force Determinization of NFAs by Means of State Covers
Finite automata determinization is a critical operation for numerous practical applications such as regular expression search. Algorithms have to deal with the possible blow up of ...
Jean-Marc Champarnaud, Fabien Coulon, Thomas Paran...
CDC
2010
IEEE
151views Control Systems» more  CDC 2010»
14 years 11 months ago
On the optimal solutions of the infinite-horizon linear sensor scheduling problem
This paper studies the infinite-horizon sensor scheduling problem for linear Gaussian processes with linear measurement functions. Several important properties of the optimal infin...
Wei Zhang, Michael P. Vitus, Jianghai Hu, Alessand...