Sciweavers

1879 search results - page 45 / 376
» Laboratories for Data Communications and Computer Networking
Sort
View
STOC
1994
ACM
134views Algorithms» more  STOC 1994»
14 years 22 days ago
A coding theorem for distributed computation
Shannon's Coding Theorem shows that in order to reliably transmit a message of T bits over a noisy communication channel, only a constant slowdown factor is necessary in the ...
Sridhar Rajagopalan, Leonard J. Schulman
ICC
2009
IEEE
109views Communications» more  ICC 2009»
14 years 3 months ago
RF in the Jungle: Effect of Environment Assumptions on Wireless Experiment Repeatability
Abstract—Most researchers conduct wireless networking experiments in their laboratory or similar indoor environments. Such environments are veritable RF jungles, especially when ...
T. Ryan Burchfield, Ehsan Nourbakhsh, Jeff Dix, Ku...
HPDC
2002
IEEE
14 years 1 months ago
An Evaluation of Object-Based Data Transfers on High Performance Networks
In this paper, we describe FOBS: a simple userlevel communication protocol designed to take advantage of the available bandwidth in a highbandwidth, high-delay network environment...
Phillip M. Dickens, William Gropp
KDD
2012
ACM
200views Data Mining» more  KDD 2012»
11 years 11 months ago
Vertex neighborhoods, low conductance cuts, and good seeds for local community methods
The communities of a social network are sets of vertices with more connections inside the set than outside. We theoretically demonstrate that two commonly observed properties of s...
David F. Gleich, C. Seshadhri
TDP
2010
166views more  TDP 2010»
13 years 3 months ago
Communication-Efficient Privacy-Preserving Clustering
The ability to store vast quantities of data and the emergence of high speed networking have led to intense interest in distributed data mining. However, privacy concerns, as well ...
Geetha Jagannathan, Krishnan Pillaipakkamnatt, Reb...