27 search results - page 5 / 6 » High-Throughput Random Access via Codes on Graphs |
SIGMETRICS
2011
ACM
13 years 7 days ago
2011
ACM
In recent years the High Performance Computing (HPC) industry has benefited from the development of higher density multi-core processors. With recent chips capable of executing u...
BMCBI
2005
13 years 5 months ago
2005
Background: Graph theory provides a computational framework for modeling a variety of datasets including those emerging from genomics, proteomics, and chemical genetics. Networks ...
ICC
2008
IEEE
13 years 11 months ago
2008
IEEE
Abstract—Signature quantization for reverse-link Direct Sequence (DS)- Code Division Multiple Access (CDMA) is considered. A receiver assumed to have perfect estimates of channel...
ICASSP
2010
IEEE
13 years 5 months ago
2010
IEEE
This paper describes our recent analysis on the security and privacy of biometric feature vectors obtained from fingerprint minutiae. A large number of contiguous regions (cuboid...
WWW
2007
ACM
14 years 6 months ago
2007
ACM
A minimal perfect function maps a static set of keys on to the range of integers {0,1,2, ... , - 1}. We present a scalable high performance algorithm based on random graphs for ...