Sciweavers

3600 search results - page 14 / 720
» The settling-time reducibility ordering
Sort
View
CORR
2004
Springer
104views Education» more  CORR 2004»
13 years 7 months ago
Ramanujan Graphs and the Random Reducibility of Discrete Log on Isogenous Elliptic Curves
Cryptographic applications using an elliptic curve over a finite field filter curves for suitability using their order as the primary criterion: e.g. checking that their order has...
David Jao, Stephen D. Miller, Ramarathnam Venkates...
CRYPTO
2008
Springer
95views Cryptology» more  CRYPTO 2008»
13 years 9 months ago
Preimages for Reduced SHA-0 and SHA-1
In this paper, we examine the resistance of the popular hash function SHA-1 and its predecessor SHA-0 against dedicated preimage attacks. In order to assess the security margin of ...
Christophe De Cannière, Christian Rechberge...
ATMOS
2009
105views Optimization» more  ATMOS 2009»
13 years 8 months ago
Scheduling Aircraft to Reduce Controller Workload
We address a problem in air traffic management: scheduling flights in order to minimize the maximum number of aircraft that simultaneously lie within a single air traffic control ...
Joondong Kim, Alexander Kroeller, Joseph S. B. Mit...
FUIN
2007
95views more  FUIN 2007»
13 years 7 months ago
Compositional Systems over Reducible Networks
Abstract. In the paper two notions related to local (distributed) computations are identified and discussed. The first one is the notion of reducible graphs. A graph is reducible...
Antoni W. Mazurkiewicz
VTC
2006
IEEE
14 years 1 months ago
Complexity-Reduced Iterative MAP Receiver with Partial Sphere Decoding in Spatial Multiplexing System
– In this paper, a partial sphere decoding approach is proposed to reduce the computational complexity of implementing the iterative MAP receiver for spatial multiplexing system,...
Hyung Ho Park, Tae Young Min, Dong Seung Kwon, Chu...