Sciweavers

2421 search results - page 30 / 485
» Approximate Flow-Aware Networking
Sort
View
TMC
2011
203views more  TMC 2011»
14 years 6 months ago
Throughput Optimization in Mobile Backbone Networks
—This paper describes new algorithms for throughput optimization in a mobile backbone network. This hierarchical communication framework combines mobile backbone nodes, which hav...
Emily M. Craparo, Jonathan P. How, Eytan Modiano
JMLR
2010
143views more  JMLR 2010»
14 years 6 months ago
Incremental Sigmoid Belief Networks for Grammar Learning
We propose a class of Bayesian networks appropriate for structured prediction problems where the Bayesian network's model structure is a function of the predicted output stru...
James Henderson, Ivan Titov
SIGMOD
2011
ACM
206views Database» more  SIGMOD 2011»
14 years 2 months ago
Sampling based algorithms for quantile computation in sensor networks
We study the problem of computing approximate quantiles in large-scale sensor networks communication-efficiently, a problem previously studied by Greenwald and Khana [12] and Shri...
Zengfeng Huang, Lu Wang, Ke Yi, Yunhao Liu
TMC
2012
13 years 2 months ago
A Statistical Mechanics-Based Framework to Analyze Ad Hoc Networks with Random Access
—Characterizing the performance of ad hoc networks is one of the most intricate open challenges; conventional ideas based on information-theoretic techniques and inequalities hav...
Sunil Srinivasa, Martin Haenggi
SPAA
2009
ACM
16 years 11 days ago
Approximation algorithms for time-constrained scheduling on line networks
We consider the problem of time-constrained scheduling of packets in a communication network. Each packet has, in addition to its source and its destination, a release time and a ...
Harald Räcke, Adi Rosén