Sciweavers

95 search results - page 8 / 19
» Fast Multiparty Multiplications from shared bits
Sort
View
SODA
2008
ACM
144views Algorithms» more  SODA 2008»
13 years 11 months ago
Fast dimension reduction using Rademacher series on dual BCH codes
The Fast Johnson-Lindenstrauss Transform (FJLT) was recently discovered by Ailon and Chazelle as a novel technique for performing fast dimension reduction with small distortion fr...
Nir Ailon, Edo Liberty
SIGCOMM
2009
ACM
14 years 4 months ago
Building a fast, virtualized data plane with programmable hardware
Network virtualization allows many networks to share the same underlying physical topology; this technology has offered promise both for experimentation and for hosting multiple n...
Muhammad Bilal Anwer, Nick Feamster
IAJIT
2008
78views more  IAJIT 2008»
13 years 9 months ago
Performance Analyses of Fast Frequency Hopping Spread Spectrum and Jamming Systems
: As technology becomes increasingly able to meet the requirements, interest in faster, noncoherent, frequency hopping rates to reduce the jamming of communication has heightened. ...
Abid Yahya, Othman Sidek, Junita Mohamad-Saleh
FAST
2007
13 years 11 months ago
AMP: Adaptive Multi-stream Prefetching in a Shared Cache
Abstract— Prefetching is a widely used technique in modern data storage systems. We study the most widely used class of prefetching algorithms known as sequential prefetching. Th...
Binny S. Gill, Luis Angel D. Bathen
ASAP
2005
IEEE
96views Hardware» more  ASAP 2005»
14 years 3 months ago
On-Chip Lookup Tables for Fast Symmetric-Key Encryption
On public communication networks such as the Internet, data confidentiality can be provided by symmetric-key ciphers. One of the most common operations used in symmetric-key ciphe...
A. Murat Fiskiran, Ruby B. Lee