Sciweavers

3008 search results - page 515 / 602
» Independence in connected graphs
Sort
View
FOCS
2008
IEEE
16 years 25 days ago
Clock Synchronization with Bounded Global and Local Skew
We present a distributed clock synchronization algorithm that guarantees an exponentially improved bound of O(log D) on the clock skew between neighboring nodes in any graph G of ...
Christoph Lenzen, Thomas Locher, Roger Wattenhofer
GLOBECOM
2008
IEEE
16 years 25 days ago
Network Formation Games for Distributed Uplink Tree Construction in IEEE 802.16J Networks
— This paper investigates the problem of the formation of an uplink tree structure among the IEEE 802.16j network’s relay stations (RSs) and their serving base station (MR-BS)....
Walid Saad, Zhu Han, Mérouane Debbah, Are H...
LICS
2008
IEEE
16 years 23 days ago
A Neutral Approach to Proof and Refutation in MALL
We propose a setting in which the search for a proof of B or a refutation of B (a proof of ¬B) can be carried out simultaneously: this is in contrast to the usual approach in aut...
Olivier Delande, Dale Miller
CIDM
2007
IEEE
16 years 21 days ago
Prediction of Abnormal Behaviors for Intelligent Video Surveillance Systems
–The OBSERVER is a video surveillance system that detects and predicts abnormal behaviors aiming at the intelligent surveillance concept. The system acquires color images from a ...
Duarte Duque, Henrique Santos, Paulo Cortez
ICDCS
2007
IEEE
16 years 20 days ago
Scale-Free Overlay Topologies with Hard Cutoffs for Unstructured Peer-to-Peer Networks
In unstructured peer-to-peer (P2P) networks, the overlay topology (or connectivity graph) among peers is a crucial component in addition to the peer/data organization and search. ...
Hasan Guclu, Murat Yuksel