Sciweavers

1477 search results - page 177 / 296
» On Graph Problems in a Semi-streaming Model
Sort
View
INFOCOM
2009
IEEE
15 years 4 months ago
Lightweight Coloring and Desynchronization for Networks
—We study the distributed desynchronization problem for graphs with arbitrary topology. Motivated by the severe computational limitations of sensor networks, we present a randomi...
Arik Motskin, Tim Roughgarden, Primoz Skraba, Leon...
IPPS
2009
IEEE
15 years 4 months ago
Deadlock prevention by turn prohibition in interconnection networks
Abstract—In this paper we consider the problem of constructing minimal cycle-breaking sets of turns for graphs that model communication networks, as a method to prevent deadlocks...
Lev B. Levitin, Mark G. Karpovsky, Mehmet Mustafa
ICPR
2008
IEEE
15 years 4 months ago
Resolution enhancement for binocular stereo
Traditional stereo algorithms estimate disparity at the same resolution as the observations. In this work we address the problem of estimating disparity and occlusion information ...
Arnav V. Bhavsar, A. N. Rajagopalan
ICNP
2007
IEEE
15 years 4 months ago
Network Court Protocol and Malicious Node Conviction
- A Network Court Protocol is designed for malicious node conviction based on information from network node accusing and testifying operations, which are formally modeled by algebr...
Na Li, David Lee
DCOSS
2009
Springer
15 years 2 months ago
Distributed Generation of a Family of Connected Dominating Sets in Wireless Sensor Networks
We study the problem of computing a family of connected dominating sets in wireless sensor networks (WSN) in a distributed manner. A WSN is modelled as a unit disk graph G = (V, E)...
Kamrul Islam, Selim G. Akl, Henk Meijer