Sciweavers

429 search results - page 9 / 86
» Permutative Additives and Exponentials
Sort
View
ISSAC
1994
Springer
165views Mathematics» more  ISSAC 1994»
13 years 11 months ago
Constructing Permutation Representations for Large Matrix Groups
New techniques, both theoretical and practical, are presented for constructing a permutation representation for a matrix group. We assume that the resulting permutation degree, n,...
Gene Cooperman, Larry Finkelstein, Bryant W. York,...
COMBINATORICS
2007
49views more  COMBINATORICS 2007»
13 years 7 months ago
Wreath Products of Permutation Classes
A permutation class which is closed under pattern involvement may be described in terms of its basis. The wreath product construction X Y of two permutation classes X and Y is als...
Robert Brignall
ATAL
2008
Springer
13 years 9 months ago
The permutable POMDP: fast solutions to POMDPs for preference elicitation
The ability for an agent to reason under uncertainty is crucial for many planning applications, since an agent rarely has access to complete, error-free information about its envi...
Finale Doshi, Nicholas Roy
CTRSA
2004
Springer
96views Cryptology» more  CTRSA 2004»
14 years 1 months ago
Self-Randomized Exponentiation Algorithms
Abstract. Exponentiation is a central process in many public-key cryptosystems such as RSA and DH. This paper introduces the concept of self-randomized exponentiation as an efficie...
Benoît Chevallier-Mames
ICASSP
2011
IEEE
12 years 11 months ago
Sliding window greedy RLS for sparse filters
We present a sliding window RLS for sparse filters, based on the greedy least squares algorithm. The algorithm adapts a partial QR factorization with pivoting, using a simplifie...
Alexandru Onose, Bogdan Dumitrescu, Ioan Tabus