953 search results - page 191 / 191 » A note on the paper |
ACNS
2009
Springer
14 years 2 months ago
2009
Springer
In this paper, we present a pseudo-collision attack on the compression function of all Twister variants (224,256,384,512) with complexity of about 226.5 compression function evalua...
VR
2003
IEEE
14 years 26 days ago
2003
IEEE
We present an experiment comparing double exponential smoothing and Kalman filter-based predictive tracking algorithms with derivative free measurement models. Our results show t...
ECCC
2007
13 years 7 months ago
2007
In the undirected Edge-Disjoint Paths problem with Congestion (EDPwC), we are given an undirected graph with V nodes, a set of terminal pairs and an integer c. The objective is to...