Sciweavers

1369 search results - page 136 / 274
» Lattice computations for random numbers
Sort
View
SPAA
2005
ACM
14 years 2 months ago
Admission control to minimize rejections and online set cover with repetitions
We study the admission control problem in general networks. Communication requests arrive over time, and the online algorithm accepts or rejects each request while maintaining the...
Noga Alon, Yossi Azar, Shai Gutner
DCG
2006
110views more  DCG 2006»
13 years 9 months ago
High-Dimensional Centrally Symmetric Polytopes with Neighborliness Proportional to Dimension
Let A be a d by n matrix, d < n. Let C be the regular cross polytope (octahedron) in Rn . It has recently been shown that properties of the centrosymmetric polytope P = AC are ...
David L. Donoho
DATE
2009
IEEE
119views Hardware» more  DATE 2009»
14 years 3 months ago
Statistical fault injection: Quantified error and confidence
— Fault injection has become a very classical method to determine the dependability of an integrated system with respect to soft errors. Due to the huge number of possible error ...
Régis Leveugle, A. Calvez, Paolo Maistri, P...
WCNC
2008
IEEE
14 years 3 months ago
Distributed Space-Frequency Coding over Amplify-and-Forward Relay Channels
Abstract— In this paper, the design of distributed spacefrequency codes (DSFCs) for wireless relay networks employing the amplify-and-forward (AAF) protocol is considered. The te...
Karim G. Seddik, K. J. Ray Liu
WISA
2007
Springer
14 years 3 months ago
Breaking 104 Bit WEP in Less Than 60 Seconds
We demonstrate an active attack on the WEP protocol that is able to recover a 104-bit WEP key using less than 40,000 frames with a success probability of 50%. In order to succeed i...
Erik Tews, Ralf-Philipp Weinmann, Andrei Pyshkin