Sciweavers

364 search results - page 18 / 73
» Computing Communities in Large Networks Using Random Walks
Sort
View
99
Voted
ADHOCNETS
2009
Springer
15 years 4 months ago
Error Correction with the Implicit Encoding Capability of Random Network Coding
—We introduce a novel error correction scheme that uses the implicit encoding capability of Random Network Coding. This scheme does not add redundancy to the data prior to transm...
Suné von Solms, Magdalena J. Grobler, Alber...
99
Voted
IMC
2006
ACM
15 years 3 months ago
On unbiased sampling for unstructured peer-to-peer networks
This paper addresses the difficult problem of selecting representative samples of peer properties (e.g., degree, link bandwidth, number of files shared) in unstructured peer-to-p...
Daniel Stutzbach, Reza Rejaie, Nick G. Duffield, S...
ASUNAM
2010
IEEE
14 years 11 months ago
Semi-Supervised Classification of Network Data Using Very Few Labels
The goal of semi-supervised learning (SSL) methods is to reduce the amount of labeled training data required by learning from both labeled and unlabeled instances. Macskassy and Pr...
Frank Lin, William W. Cohen
TSP
2008
100views more  TSP 2008»
14 years 9 months ago
Geographic Gossip: Efficient Averaging for Sensor Networks
Gossip algorithms for distributed computation are attractive due to their simplicity, distributed nature, and robustness in noisy and uncertain environments. However, using standa...
Alexandros G. Dimakis, Anand D. Sarwate, Martin J....
85
Voted
DCOSS
2006
Springer
15 years 1 months ago
Efficient In-Network Processing Through Local Ad-Hoc Information Coalescence
We consider in-network processing via local message passing. The considered setting involves a set of sensors each of which can communicate with a subset of other sensors. There is...
Onur Savas, Murat Alanyali, Venkatesh Saligrama