Sciweavers

1511 search results - page 169 / 303
» Randomness, lowness and degrees
Sort
View
JSAC
2006
95views more  JSAC 2006»
15 years 6 months ago
A low-rate code-spread and chip-interleaved time-hopping UWB system
We consider a code-spread and chip-interleaved time-hopping (TH) multiple-access scheme for multiuser ultra-wideband (UWB) communications. In such a system, each user's chip s...
Kai Li, Xiaodong Wang, Guosen Yue, Li Ping
PR
2008
137views more  PR 2008»
15 years 6 months ago
Cancellable biometrics and annotations on BioHash
Lately, the once powerful one-factor authentication which is based solely on either password, token or biometric approach, appears to be insufficient in addressing the challenges ...
Andrew Beng Jin Teoh, Yip Wai Kuan, Sangyoun Lee
TSP
2008
145views more  TSP 2008»
15 years 6 months ago
Multichannel ALLIANCES: A Cooperative Cross-Layer Scheme for Wireless Networks
A random access protocol named ALLIANCES was recently proposed, that achieves high throughput by resolving collisions in wireless networks. ALLIANCES exploits diversity provided b...
Lun Dong, Athina P. Petropulu
TON
2002
175views more  TON 2002»
15 years 6 months ago
Compressed bloom filters
A Bloom filter is a simple space-efficient randomized data structure for representing a set in order to support membership queries. Although Bloom filters allow false positives, f...
Michael Mitzenmacher
PAMI
2007
176views more  PAMI 2007»
15 years 6 months ago
Approximate Labeling via Graph Cuts Based on Linear Programming
A new framework is presented for both understanding and developing graph-cut based combinatorial algorithms suitable for the approximate optimization of a very wide class of MRFs ...
Nikos Komodakis, Georgios Tziritas