Sciweavers

254 search results - page 24 / 51
» On the randomized solution of initial value problems
Sort
View
CRYPTO
2001
Springer
152views Cryptology» more  CRYPTO 2001»
14 years 1 months ago
Secure Distributed Linear Algebra in a Constant Number of Rounds
Consider a network of processors among which elements in a finite field K can be verifiably shared in a constant number of rounds. Assume furthermore constant-round protocols ar...
Ronald Cramer, Ivan Damgård
SCVMA
2004
Springer
14 years 2 months ago
Motion Detection Using Wavelet Analysis and Hierarchical Markov Models
This paper deals with the motion detection problem. This issue is of key importance in many application fields. To solve this problem, we compute the dominant motion in the sequen...
Cédric Demonceaux, Djemâa Kachi-Akkou...
ICS
2010
Tsinghua U.
14 years 6 months ago
Cryptography by Cellular Automata or How Fast Can Complexity Emerge in Nature?
Computation in the physical world is restricted by the following spatial locality constraint: In a single unit of time, information can only travel a bounded distance in space. A ...
Benny Applebaum, Yuval Ishai, Eyal Kushilevitz
GECCO
2007
Springer
209views Optimization» more  GECCO 2007»
14 years 3 months ago
An online implementable differential evolution tuned optimal guidance law
This paper proposes a novel application of differential evolution to solve a difficult dynamic optimisation or optimal control problem. The miss distance in a missile-target engag...
Raghunathan Thangavelu, S. Pradeep
ADHOC
2007
115views more  ADHOC 2007»
13 years 9 months ago
Modeling adaptive node capture attacks in multi-hop wireless networks
We investigate the problem of modeling node capture attacks in heterogeneous wireless ad hoc and mesh networks. Classical adversarial models such as the Dolev–Yao model are know...
Patrick Tague, Radha Poovendran