Sciweavers

208 search results - page 7 / 42
» Optimal SINR-based Random Access
Sort
View
ALGORITHMICA
2005
108views more  ALGORITHMICA 2005»
13 years 7 months ago
Key-Independent Optimality
A new form of optimality for comparison based static dictionaries is introduced. This type of optimality, keyindependent optimality, is motivated by applications that assign key v...
John Iacono
WEA
2007
Springer
125views Algorithms» more  WEA 2007»
14 years 1 months ago
Simple Compression Code Supporting Random Access and Fast String Matching
Given a sequence S of n symbols over some alphabet Σ, we develop a new compression method that is (i) very simple to implement; (ii) provides O(1) time random access to any symbol...
Kimmo Fredriksson, Fedor Nikitin
GLOBECOM
2009
IEEE
14 years 2 months ago
Channel Aware Distributed Random Access
—We investigate distributed channel-aware random access for networks with arbitrary topologies and traffic distributions, where users can receive traffic from or send traffic ...
Guowang Miao, Ye (Geoffrey) Li, Ananthram Swami
DCC
2010
IEEE
14 years 2 months ago
LZ77-Like Compression with Fast Random Access
We introduce an alternative Lempel-Ziv text parsing, LZ-End, that converges to the entropy and in practice gets very close to LZ77. LZ-End forces sources to finish at the end of ...
Sebastian Kreft, Gonzalo Navarro
ICC
2007
IEEE
288views Communications» more  ICC 2007»
14 years 2 months ago
Joint Channel State Based Random Access and Adaptive Modulation in Wireless LAN with Multi-Packet Reception
—Conventional 802.11 medium access control (MAC) characteristics. In particular, all of these designs adopted a protocols have been designed separately from the characteristics s...
Wei Lan Huang, Khaled Ben Letaief, Ying Jun Zhang