986 search results - page 168 / 198 » Algorithmic Lower Bounds for Problems Parameterized by Cliqu... |
125
Voted
INFOCOM
2010
IEEE
15 years 2 months ago
2010
IEEE
Abstract—The main task in analyzing a switching network design (including circuit-, multirate-, and photonic-switching) is to determine the minimum number of some switching compo...
129
Voted
INFOCOM
2005
IEEE
15 years 9 months ago
2005
IEEE
— We consider the problem of scheduling multiple users sharing a time-varying wireless channel. (As an example, this is a model of scheduling in 3G wireless technologies, such as...
135
Voted
CIKM
2006
Springer
15 years 7 months ago
2006
Springer
In this paper we introduce the distributed spatio-temporal similarity search problem: given a query trajectory Q, we want to find the trajectories that follow a motion similar to ...
132
Voted
NETWORKING
2004
15 years 4 months ago
2004
We consider the problem of traffic grooming in WDM ring networks. Previous studies have focused on minimizing aggregate representations of the network cost. In this work, we consid...
129
Voted
SIROCCO
2004
15 years 4 months ago
2004
We study here the gossiping problem (all-to-all communication) in known radio networks, i.e., when all nodes are aware of the network topology. We start our presentation with a det...