Sciweavers

4865 search results - page 709 / 973
» The Complexity of Graph Connectivity
Sort
View
WWW
2010
ACM
15 years 11 months ago
Empirical comparison of algorithms for network community detection
Detecting clusters or communities in large real-world graphs such as large social or information networks is a problem of considerable interest. In practice, one typically chooses...
Jure Leskovec, Kevin J. Lang, Michael W. Mahoney
ERCIMDL
2009
Springer
225views Education» more  ERCIMDL 2009»
15 years 11 months ago
Demonstration of User Interfaces for Querying in 3D Architectural Content in PROBADO3D
Abstract. The PROBADO project is a research effort to develop Digital Library support for non-textual documents. The main goal is to contribute to all parts of the Digital Library...
René Bernd, Ina Blümel, Harald Krottma...
GLOBECOM
2006
IEEE
15 years 10 months 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
156
Voted
INFOCOM
2006
IEEE
15 years 10 months 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....
157
Voted
IWDC
2005
Springer
138views Communications» more  IWDC 2005»
15 years 10 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