Sciweavers

31 search results - page 4 / 7
» Asymptotic cycles
Sort
View
GLOBECOM
2010
IEEE
13 years 5 months ago
A Distributed Wake-Up Scheduling for Opportunistic Forwarding in Wireless Sensor Networks
In wireless sensor networks (WSNs), sensor nodes are typically subjected to energy constraints and often prone to topology changes. While duty cycling has been widely used for ener...
Chul-Ho Lee, Do Young Eun
TCOM
2008
127views more  TCOM 2008»
13 years 7 months ago
Low complexity affine MMSE detector for iterative detection-decoding MIMO OFDM systems
Iterative turbo processing between detection and decoding shows near-capacity performance on a multiple-antenna system. Combining iterative processing with optimum frontend detecti...
Daniel N. Liu, Michael P. Fitz
WG
1998
Springer
13 years 11 months ago
Integral Uniform Flows in Symmetric Networks
We study the integral uniform (multicommodity) flow problem in a graph G and construct a fractional solution whose properties are invariant under the action of a group of automorp...
Farhad Shahrokhi, László A. Sz&eacut...
CORR
2008
Springer
103views Education» more  CORR 2008»
13 years 7 months ago
Generating Random Graphs with Large Girth
We present a simple and efficient algorithm for randomly generating simple graphs without small cycles. These graphs can be used to design high performance Low-Density Parity-Chec...
Mohsen Bayati, Andrea Montanari, Amin Saberi
CPC
2002
95views more  CPC 2002»
13 years 7 months ago
Permutation Pseudographs And Contiguity
The space of permutation pseudographs is a probabilistic model of 2-regular pseudographs on n vertices, where a pseudograph is produced by choosing a permutation of {1, 2, . . . ...
Catherine S. Greenhill, Svante Janson, Jeong Han K...