Sciweavers

3008 search results - page 590 / 602
» Independence in connected graphs
Sort
View
ICC
2008
IEEE
141views Communications» more  ICC 2008»
14 years 1 months ago
Multilevel Structured Low-Density Parity-Check Codes
— Low-Density Parity-Check (LDPC) codes are typically characterized by a relatively high-complexity description, since a considerable amount of memory is required in order to sto...
Nicholas Bonello, Sheng Chen, Lajos Hanzo
ICCCN
2008
IEEE
14 years 1 months ago
Localized Bridging Centrality for Distributed Network Analysis
— Centrality is a concept often used in social network analysis to study different properties of networks that are modeled as graphs. We present a new centrality metric called Lo...
Soumendra Nanda, David Kotz
COMSWARE
2007
IEEE
14 years 1 months ago
VillageNet: A low-cost, 802.11-based mesh network for rural regions
— VillageNet is a wireless mesh network that aims to provide low-cost broadband Internet access for rural regions. The cost of building the network is kept low by using off-the-s...
Partha Dutta, Sharad Jaiswal, Debmalya Panigrahi, ...
SECON
2007
IEEE
14 years 1 months ago
INPoD: In-Network Processing over Sensor Networks based on Code Design
—In this paper, we develop a joint Network Coding (NC)-channel coding error-resilient sensor-network approach that performs In-Network Processing based on channel code Design (IN...
Kiran Misra, Shirish S. Karande, Hayder Radha
ICCS
2007
Springer
14 years 1 months ago
Characterizing Implications of Injective Partial Orders
Abstract. Previous work of the authors has studied a notion of implication between sets of sequences based on the conceptual structure of a Galois lattice, and also a way of repres...
José L. Balcázar, Gemma C. Garriga