Sciweavers

791 search results - page 115 / 159
» Approximating the Maximum Sharing Problem
Sort
View
ICPPW
2002
IEEE
14 years 24 days ago
Finding Multiple Routing Paths in Wide-Area WDM Networks
In this paper a multiple routing path problem in wide area Wavelength Division Multiplexing (WDM) networks is considered, which is to find K edge-disjoint lightpaths/semilightpat...
Weifa Liang, Xiaojun Shen
ALT
2010
Springer
13 years 9 months ago
Inferring Social Networks from Outbreaks
We consider the problem of inferring the most likely social network given connectivity constraints imposed by observations of outbreaks within the network. Given a set of vertices ...
Dana Angluin, James Aspnes, Lev Reyzin
AUTOMATICA
2008
93views more  AUTOMATICA 2008»
13 years 8 months ago
An LFT approach to parameter estimation
In this paper we consider a unified framework for parameter estimation problems which arise in a system identification context. In this framework, the parameters to be estimated a...
Kenneth Hsu, Tyrone L. Vincent, Greg Wolodkin, Sun...
TCS
2008
13 years 7 months ago
Bincoloring
We introduce a new problem that was motivated by a (more complicated) problem arising in a robotized assembly environment. The bin coloring problem is to pack unit size colored it...
Sven Oliver Krumke, Willem de Paepe, Jörg Ram...
TCOM
2010
167views more  TCOM 2010»
13 years 6 months ago
On distributed scheduling in wireless networks exploiting broadcast and network coding
—In this paper, we consider cross-layer optimization in wireless networks with wireless broadcast advantage, focusing on the problem of distributed scheduling of broadcast links....
Tao Cui, Lijun Chen, Tracey Ho