Sciweavers

3356 search results - page 198 / 672
» Determining Consensus Numbers
Sort
View
EUROCRYPT
2001
Springer
15 years 10 months ago
New Method for Upper Bounding the Maximum Average Linear Hull Probability for SPNs
Abstract. We present a new algorithm for upper bounding the maximum average linear hull probability for SPNs, a value required to determine provable security against linear cryptan...
Liam Keliher, Henk Meijer, Stafford E. Tavares
152
Voted
ISSAC
2001
Springer
123views Mathematics» more  ISSAC 2001»
15 years 10 months ago
A probabilistic algorithm to test local algebraic observability in polynomial time
The following questions are often encountered in system and control theory. Given an algebraic model of a physical process, which variables can be, in theory, deduced from the inp...
Alexandre Sedoglavic
IPPS
1999
IEEE
15 years 10 months ago
Distributed, Scalable, Dependable Real-Time Systems: Middleware Services and Applications
Some classes of real-time systems function in environments which cannot be modeled with static approaches. In such environments, the arrival rates of events which drive transient ...
Lonnie R. Welch, Binoy Ravindran, Paul V. Werme, M...
LCR
1998
Springer
137views System Software» more  LCR 1998»
15 years 10 months ago
Integrated Task and Data Parallel Support for Dynamic Applications
There is an emerging class of real-time interactive applications that require the dynamic integration of task and data parallelism. An example is the Smart Kiosk, a free-standing ...
James M. Rehg, Kathleen Knobe, Umakishore Ramachan...
AB
2007
Springer
15 years 10 months ago
Prefix Reversals on Binary and Ternary Strings
Given a permutation , the application of prefix reversal f(i) to reverses the order of the first i elements of . The problem of Sorting By Prefix Reversals (also known as pancake ...
Cor A. J. Hurkens, Leo van Iersel, Judith Keijsper...