Sciweavers

77 search results - page 2 / 16
» Evaluation Properties of Symmetric Polynomials
Sort
View
SACRYPT
2004
Springer
143views Cryptology» more  SACRYPT 2004»
13 years 10 months ago
Blockwise Adversarial Model for On-line Ciphers and Symmetric Encryption Schemes
Abstract. This paper formalizes the security adversarial games for online symmetric cryptosystems in a unified framework for deterministic and probabilistic encryption schemes. On...
Pierre-Alain Fouque, Antoine Joux, Guillaume Poupa...
AUTOMATICA
2011
12 years 9 months ago
A hierarchy of LMI inner approximations of the set of stable polynomials
Exploiting spectral properties of symmetric banded Toeplitz matrices, we describe simple sufficient conditions for positivity of a trigonometric polynomial formulated as linear ma...
Mustapha Ait Rami, Didier Henrion
COCO
2009
Springer
117views Algorithms» more  COCO 2009»
13 years 12 months ago
The Proof Complexity of Polynomial Identities
Devising an efficient deterministic – or even a nondeterministic sub-exponential time – algorithm for testing polynomial identities is a fundamental problem in algebraic comp...
Pavel Hrubes, Iddo Tzameret
TPDS
2008
164views more  TPDS 2008»
13 years 5 months ago
Hierarchical Scheduling for Symmetric Multiprocessors
Hierarchical scheduling has been proposed as a scheduling technique to achieve aggregate resource partitioning among related groups of threads and applications in uniprocessor and...
Abhishek Chandra, Prashant J. Shenoy
EURODAC
1994
IEEE
186views VHDL» more  EURODAC 1994»
13 years 9 months ago
Algorithms for a switch module routing problem
We consider a switch module routing problem for symmetric array FPGAs. The work is motivated by two applications. The rst is that of eciently evaluating switch module designs [8]...
Shashidhar Thakur, D. F. Wong, S. Muthukrishnan