Sciweavers

4781 search results - page 344 / 957
» Online algorithms for network design
Sort
View
MST
2010
117views more  MST 2010»
15 years 5 months ago
Class Constrained Bin Covering
We study the following variant of the bin covering problem. We are given a set of unit sized items, where each item has a color associated with it. We are given an integer paramet...
Leah Epstein, Csanád Imreh, Asaf Levin
IMC
2003
ACM
16 years 2 days ago
Simple network performance tomography
In network performance tomography, characteristics of the network interior are inferred by correlating end-to-end measurements. In much previous work, the presence of correlations...
Nick G. Duffield
ANCS
2006
ACM
16 years 25 days ago
A practical fast parallel routing architecture for Clos networks
Clos networks are an important class of switching networks due to their modular structure and much lower cost compared with crossbars. For routing I/O permutations of Clos network...
Si-Qing Zheng, Ashwin Gumaste, Enyue Lu
ICCV
2005
IEEE
16 years 13 days ago
KALMANSAC: Robust Filtering by Consensus
We propose an algorithm to perform causal inference of the state of a dynamical model when the measurements are corrupted by outliers. While the optimal (maximumlikelihood) soluti...
Andrea Vedaldi, Hailin Jin, Paolo Favaro, Stefano ...
PEWASUN
2004
ACM
16 years 8 days ago
A modified IEEE 802.11 MAC protocol for MC-CDMA
In this paper, we introduce a modified version of the IEEE 802.11a protocol and evaluate its performance. The new protocol is a combination of the standard Medium Access Control (...
Georgios Orfanos, Jörg Habetha, Ling Liu