Sciweavers

745 search results - page 49 / 149
» On Generating Random Network Structures: Connected Graphs
Sort
View
149
Voted
WAW
2010
Springer
235views Algorithms» more  WAW 2010»
14 years 10 months ago
Multiplicative Attribute Graph Model of Real-World Networks
Large scale real-world network data such as social and information networks are ubiquitous. The study of such social and information networks seeks to find patterns and explain th...
Myunghwan Kim, Jure Leskovec
108
Voted
SNPD
2007
15 years 1 months ago
Localized Flooding Backbone Construction for Location Privacy in Sensor Networks
Source and destination location privacy is a challenging and important problem in sensor networks. Nevertheless, privacy preserving communication in sensor networks is still a vir...
Yingchang Xiang, Dechang Chen, Xiuzhen Cheng, Kai ...
167
Voted
ICML
2003
IEEE
16 years 1 months ago
Semi-Supervised Learning Using Gaussian Fields and Harmonic Functions
An approach to semi-supervised learning is proposed that is based on a Gaussian random field model. Labeled and unlabeled data are represented as vertices in a weighted graph, wit...
Xiaojin Zhu, Zoubin Ghahramani, John D. Lafferty
101
Voted
KDD
2007
ACM
220views Data Mining» more  KDD 2007»
16 years 28 days ago
SCAN: a structural clustering algorithm for networks
Network clustering (or graph partitioning) is an important task for the discovery of underlying structures in networks. Many algorithms find clusters by maximizing the number of i...
Xiaowei Xu, Nurcan Yuruk, Zhidan Feng, Thomas A. J...
123
Voted
IPSN
2004
Springer
15 years 5 months ago
Naps: scalable, robust topology management in wireless ad hoc networks
Topology management schemes conserve energy in wireless ad hoc networks by identifying redundant nodes that may turn off their radios or other components while maintaining connec...
Brighten Godfrey, David Ratajczak