Sciweavers

178 search results - page 20 / 36
» Constructing the Spanners of Graphs in Parallel
Sort
View
MM
2009
ACM
220views Multimedia» more  MM 2009»
14 years 5 days ago
Multi-modal scene segmentation using scene transition graphs
In this work the problem of automatic decomposition of video into elementary semantic units, known in the literature as scenes, is addressed. Two multi-modal automatic scene segme...
Panagiotis Sidiropoulos, Vasileios Mezaris, Ioanni...
DCOSS
2008
Springer
13 years 9 months ago
Local PTAS for Independent Set and Vertex Cover in Location Aware Unit Disk Graphs
We present the first local approximation schemes for maximum independent set and minimum vertex cover in unit disk graphs. In the graph model we assume that each node knows its geo...
Andreas Wiese, Evangelos Kranakis
PODC
2009
ACM
14 years 8 months ago
A distributed polylogarithmic time algorithm for self-stabilizing skip graphs
Peer-to-peer systems rely on scalable overlay networks that enable efficient routing between its members. Hypercubic topologies facilitate such operations while each node only nee...
Riko Jacob, Andréa W. Richa, Christian Sche...
GD
1999
Springer
13 years 11 months ago
Visibility Representations of Complete Graphs
Abstract. In this paper we study 3-dimensional visibility representations of complete graphs. The vertices are represented by equal regular polygons lying in planes parallel to the...
Robert Babilon, Helena Nyklová, Ondrej Pang...
DCOSS
2005
Springer
14 years 1 months ago
Infrastructure-Establishment from Scratch in Wireless Sensor Networks
Abstract. We present a distributed, localized and integrated approach for establishing both low-level (i.e. exploration of 1-hop neighbors, interference avoidance) and high-level (...
Stefan Funke, Nikola Milosavljevic