929 search results - page 61 / 186 » On Computation and Communication with Small Bias |
MOBIHOC
2002
ACM
14 years 8 months ago
2002
ACM
We present a series of approximation algorithms for finding a small weakly-connected dominating set (WCDS) in a given graph to be used in clustering mobile ad hoc networks. The st...
SIGCOMM
2009
ACM
14 years 3 months ago
2009
ACM
Most of the existing literature on empirical studies of Online Social Networks (OSNs) have focused on characterizing and modeling the structure of their inferred friendship graphs...
TELETRAFFIC
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. We focus in this paper on passive traffic measurement techniques that collect traces of TCP packets and analyze them to derive, for example, round-trip times or aggregate...
IPPS
1998
IEEE
14 years 1 months ago
1998
IEEE
The problem of scheduling a weighted directed acyclic graph (DAG) to a set of homogeneous processors to minimize the completion time has been extensively studied. The NPcompletene...
CHI
1993
ACM
14 years 26 days ago
1993
ACM
An adaptive user interface relies, to a large extent, upon an adequate user model (e.g., a representationof user-expertise). However, building a user model may be a tedious and ti...