Sciweavers

352 search results - page 53 / 71
» Fail-Awareness in Timed Asynchronous Systems
Sort
View
SPAA
1997
ACM
14 years 27 days ago
Pipelining with Futures
Pipelining has been used in the design of many PRAM algorithms to reduce their asymptotic running time. Paul, Vishkin, and Wagener (PVW) used the approach in a parallel implementat...
Guy E. Blelloch, Margaret Reid-Miller
SDM
2003
SIAM
123views Data Mining» more  SDM 2003»
13 years 10 months ago
Fast Online SVD Revisions for Lightweight Recommender Systems
The singular value decomposition (SVD) is fundamental to many data modeling/mining algorithms, but SVD algorithms typically have quadratic complexity and require random access to ...
Matthew Brand
DCOSS
2010
Springer
13 years 9 months ago
Self-stabilizing Synchronization in Mobile Sensor Networks with Covering
Synchronization is widely considered as an important service in distributed systems which may simplify protocol design. Phase clock is a general synchronization tool that provides ...
Joffroy Beauquier, Janna Burman
MMM
2007
Springer
119views Multimedia» more  MMM 2007»
14 years 3 months ago
Coopetitive Multimedia Surveillance
‘Coopetitive’ interaction strategy has been shown to give better results than similar strategies like ‘only cooperation’, ‘only competition’ etc [7]. However, this has ...
Vivek K. Singh, Pradeep K. Atrey, Mohan S. Kankanh...
SRDS
2000
IEEE
14 years 1 months ago
Optimistic Virtual Synchrony
Group communication systems are powerful building blocks that facilitate the development of fault-tolerant distributed applications. Such systems generally run in an asynchronous ...
Jeremy B. Sussman, Idit Keidar, Keith Marzullo