Sciweavers

139 search results - page 9 / 28
» Bandwidth on AT-Free Graphs
Sort
View
GLOBECOM
2009
IEEE
14 years 4 months ago
Fusion and Diversity Trade-Offs in Cooperative Estimation over Fading Channels
—In this paper we consider a network of distributed sensors that are trying to measure a parameter of interest cooperatively, by exchanging their acquired information repeatedly ...
Mehrzad Malmirchegini, Yasamin Mostofi
CONEXT
2008
ACM
13 years 11 months ago
Online estimation of RF interference
Increased AP density in enterprise WLANs leads to increasing RF interference and decreasing performance. An important step towards mitigating this problem is to construct precise ...
Nabeel Ahmed, Usman Ismail, Srinivasan Keshav, Kon...
CLOUD
2010
ACM
14 years 2 months ago
Hermes: clustering users in large-scale e-mail services
Hermes is an optimization engine for large-scale enterprise e-mail services. Such services could be hosted by a virtualized e-mail service provider, or by dedicated enterprise dat...
Thomas Karagiannis, Christos Gkantsidis, Dushyanth...
IPPS
2007
IEEE
14 years 4 months ago
Analyzing the Scalability of Graph Algorithms on Eldorado
The Cray MTA-2 system provides exceptional performance on a variety of sparse graph algorithms. Unfortunately, it was an extremely expensive platform. Cray is preparing an Eldorad...
Keith D. Underwood, Megan Vance, Jonathan W. Berry...
UAI
2003
13 years 11 months ago
Layerwidth: Analysis of a New Metric for Directed Acyclic Graphs
We analyze a new property of directed acyclic graphs (DAGs), called layerwidth, arising from a class of DAGs proposed by Eiter and Lukasiewicz. This class of DAGs permits certain ...
Mark Hopkins