Sciweavers

1923 search results - page 36 / 385
» Modeling Complexity in Secure Distributed Computing
Sort
View
ESORICS
2004
Springer
14 years 1 months ago
On the Role of Key Schedules in Attacks on Iterated Ciphers
This paper considers iterated ciphers and their resistance against linear and differential cryptanalysis. In the theory of these attacks one assumes independence of the round keys...
Lars R. Knudsen, John Erik Mathiassen
ISVC
2005
Springer
14 years 2 months ago
Mining Paths of Complex Crowd Scenes
The Ambient Intelligence (AmI) paradigm requires a robust interpretation of people actions and behaviour and a way for automatically generating persistent spatial-temporal models o...
Beibei Zhan, Paolo Remagnino, Sergio A. Velastin
ECCV
2004
Springer
14 years 1 months ago
Combining Simple Models to Approximate Complex Dynamics
Stochastic tracking of structured models in monolithic state spaces often requires modeling complex distributions that are difficult to represent with either parametric or sample...
Leonid Taycher, John W. Fisher III, Trevor Darrell
WDAG
2005
Springer
118views Algorithms» more  WDAG 2005»
14 years 2 months ago
Distributed Computing with Imperfect Randomness
Randomness is a critical resource in many computational scenarios, enabling solutions where deterministic ones are elusive or even provably impossible. However, the randomized solu...
Shafi Goldwasser, Madhu Sudan, Vinod Vaikuntanatha...
HPCC
2007
Springer
14 years 2 months ago
A Complex Network-Based Approach for Job Scheduling in Grid Environments
Many optimization techniques have been adopted for efficient job scheduling in grid computing, such as: genetic algorithms, simulated annealing and stochastic methods. Such techni...
Renato Porfirio Ishii, Rodrigo Fernandes de Mello,...