Sciweavers

3415 search results - page 596 / 683
» Lower Bounds for Kernelizations
Sort
View
GLOBECOM
2010
IEEE
13 years 8 months ago
An Exit-Chart Aided Design Procedure for Near-Capacity N-Component Parallel Concatenated Codes
1 Shannon's channel capacity specifies the upper bound on the amount of bits per channel use. In this paper, we explicitly demonstrate that twin-component turbo codes suffer f...
Hong Chen, Robert G. Maunder, Lajos Hanzo
GLOBECOM
2010
IEEE
13 years 8 months ago
Equitable Energy Consumption during Repeated Transmissions in a Multihop Wireless Network
This paper addresses the issue of network life during repeated broadcasts originating from the same source in large, strip-shaped wireless sensor networks. The proposed technique w...
Aravind Kailas, Mary Ann Ingram
ICGI
2010
Springer
13 years 8 months ago
Exact DFA Identification Using SAT Solvers
Abstract. We present an exact algorithm for identification of deterministic finite automata (DFA) which is based on satisfiability (SAT) solvers. Despite the size of the low level ...
Marijn J. H. Heule, Sicco Verwer
ICPADS
2010
IEEE
13 years 8 months ago
M-cube: A Duty Cycle Based Multi-channel MAC Protocol with Multiple Channel Reservation for WSNs
In this paper, a duty cycle based multi-channel MAC protocol with multiple channel reservation, called M-cube, is proposed to tackle the triple hidden terminal problems. M-cube can...
Jinbao Li, Desheng Zhang, Longjiang Guo, Shouling ...
IMC
2010
ACM
13 years 8 months ago
On the impact of layer-2 on node degree distribution
The Internet topology data collected through traceroute exploration has been extensively studied in the past. In particular, a remarkable property of the Internet, the power-law s...
Pascal Mérindol, Benoit Donnet, Olivier Bon...