Sciweavers

4679 search results - page 868 / 936
» The Timely Computing Base Model and Architecture
Sort
View
DSN
2007
IEEE
15 years 10 months ago
Electing an Eventual Leader in an Asynchronous Shared Memory System
This paper considers the problem of electing an eventual leader in an asynchronous shared memory system. While this problem has received a lot of attention in messagepassing syste...
Antonio Fernández, Ernesto Jiménez, ...
PODC
2006
ACM
15 years 10 months ago
Self-stabilizing byzantine agreement
Byzantine agreement algorithms typically assume implicit initial state consistency and synchronization among the correct nodes and then operate in coordinated rounds of informatio...
Ariel Daliot, Danny Dolev
DCOSS
2006
Springer
15 years 8 months ago
Efficient In-Network Processing Through Local Ad-Hoc Information Coalescence
We consider in-network processing via local message passing. The considered setting involves a set of sensors each of which can communicate with a subset of other sensors. There is...
Onur Savas, Murat Alanyali, Venkatesh Saligrama
CVPR
2004
IEEE
16 years 6 months ago
An Algorithm for Multiple Object Trajectory Tracking
Most tracking algorithms are based on the maximum a posteriori (MAP) solution of a probabilistic framework called Hidden Markov Model, where the distribution of the object state a...
Mei Han, Wei Xu, Hai Tao, Yihong Gong
COLCOM
2009
IEEE
15 years 9 months ago
An analytical study of GWAP-based geospatial tagging systems
—Geospatial tagging (geotagging) is an emerging and very promising application that can help users find a wide variety of location-specific information, and facilitate the deve...
Ling-Jyh Chen, Yu-Song Syu, Bo-Chun Wang, Wang-Chi...