Sciweavers

2924 search results - page 486 / 585
» Lower Bounds in Distributed Computing
Sort
View
158
Voted
WALCOM
2010
IEEE
221views Algorithms» more  WALCOM 2010»
15 years 2 months ago
Variants of Spreading Messages
In a distributed computing environment a faulty node could lead other nodes in the system to behave in a faulty manor. An initial set of faults could make all the nodes in the syst...
T. V. Thirumala Reddy, D. Sai Krishna, C. Pandu Ra...
CVPR
2004
IEEE
16 years 6 months ago
3D Facial Tracking from Corrupted Movie Sequences
In this paper we perform 3D face tracking on corrupted video sequences. We use a deformable model, combined with a predictive filter, to recover both the rigid transformations and...
Siome Goldenstein, Christian Vogler, Dimitris N. M...
PDCAT
2009
Springer
15 years 11 months ago
Analytical Study of Adversarial Strategies in Cluster-based Overlays
Abstract—Awerbuch and Scheideler have shown that peerto-peer overlays networks can survive Byzantine attacks only if malicious nodes are not able to predict what will be the topo...
Emmanuelle Anceaume, Francisco V. Brasileiro, Roma...
ICDCS
2008
IEEE
15 years 11 months ago
Mobility-Assisted Spatiotemporal Detection in Wireless Sensor Networks
Wireless sensor networks (WSNs) deployed for missioncritical applications face the fundamental challenge of meeting stringent spatiotemporal performance requirements using nodes w...
Guoliang Xing, Jianping Wang, Ke Shen, Qingfeng Hu...
IPPS
2007
IEEE
15 years 10 months ago
A Survey of Worst-Case Execution Time Analysis for Real-Time Java
As real-time systems become more prevalent, there is a need to guarantee that these increasingly complex systems perform as designed. One technique involves a static analysis to p...
Trevor Harmon, Raymond Klefstad