Sciweavers

6568 search results - page 1133 / 1314
» Reducing the Complexity of Reductions
Sort
View
COMCOM
2008
91views more  COMCOM 2008»
15 years 6 months ago
A WEP post-processing algorithm for a Robust 802.11 WLAN implementation
Wired Equivalent Privacy (WEP) protocol used within the IEEE 802.11 standard has "major security flaws" thus wireless local area networks (WLANs) using the protocol are ...
Taskin Koçak, Mohit Jagetia
CORR
2010
Springer
66views Education» more  CORR 2010»
15 years 6 months ago
Efficient Dealiased Convolutions without Padding
Algorithms are developed for calculating dealiased linear convolution sums without the expense of conventional zero-padding or phase-shift techniques. For one-dimensional in-place ...
John C. Bowman, Malcolm Roberts
CORR
2010
Springer
69views Education» more  CORR 2010»
15 years 6 months ago
Efficient Knowledge Base Management in DCSP
DCSP (Distributed Constraint Satisfaction Problem) has been a very important research area in AI (Artificial Intelligence). There are many application problems in distributed AI t...
Hong Jiang
CORR
2008
Springer
166views Education» more  CORR 2008»
15 years 6 months ago
Information-Theoretically Secure Voting Without an Honest Majority
We present three voting protocols with unconditional privacy and information-theoretic correctness, without assuming any bound on the number of corrupt voters or voting authorities...
Anne Broadbent, Alain Tapp
CORR
2008
Springer
148views Education» more  CORR 2008»
15 years 6 months ago
A Non-differential Distributed Space-Time Coding for Partially-Coherent Cooperative Communication
In a distributed space-time coding scheme, based on the relay channel model, the relay nodes co-operate to linearly process the transmitted signal from the source and forward them ...
Jagadeesh Harshan, B. Sundar Rajan
« Prev « First page 1133 / 1314 Last » Next »