Sciweavers

3008 search results - page 547 / 602
» Independence in connected graphs
Sort
View
GLOBECOM
2006
IEEE
16 years 11 days ago
Protograph LDPC Codes with Node Degrees at Least 3
— In this paper we present protograph codes with a small number of degree-3 nodes and one high degree node. The iterative decoding threshold for proposed rate 1/2 codes are lower...
Dariush Divsalar, Christopher Jones
ICNP
2006
IEEE
16 years 10 days ago
Orthogonal Rendezvous Routing Protocol for Wireless Mesh Networks
— Routing in multi-hop wireless networks involves the indirection from a persistent name (or ID) to a locator. Concepts such as coordinate space embedding help reduce the number ...
Bow-Nan Cheng, Murat Yuksel, Shivkumar Kalyanarama...
INFOCOM
2006
IEEE
16 years 10 days ago
Eclipse Attacks on Overlay Networks: Threats and Defenses
Abstract— Overlay networks are widely used to deploy functionality at edge nodes without changing network routers. Each node in an overlay network maintains connections with a nu...
Atul Singh, Tsuen-Wan Ngan, Peter Druschel, Dan S....
SSDBM
2006
IEEE
156views Database» more  SSDBM 2006»
16 years 9 days ago
On Data and Visualization Models for Signaling Pathways
Signaling pathways are chains of interacting proteins, through which the cell converts a (usually) extracellular signal into a biological response. The number of known signaling p...
Nattakarn Ratprasartporn, Ali Cakmak, Gultekin &Ou...
IWDC
2005
Springer
138views Communications» more  IWDC 2005»
15 years 11 months ago
Hierarchical Routing in Sensor Networks Using k-Dominating Sets
For a connected graph, representing a sensor network, distributed algorithms for the Set Covering Problem can be employed to construct reasonably small subsets of the nodes, calle...
Michael Q. Rieck, Subhankar Dhar