Sciweavers

947 search results - page 158 / 190
» Fault Tolerant Computation on Ensemble Quantum Computers
Sort
View
DOA
2001
137views more  DOA 2001»
13 years 9 months ago
Supporting Distributed Processing of Time-Based Media Streams
There are many challenges in devising solutions for online content processing of live networked multimedia sessions. These include content analysis under uncertainty (evidence of ...
Viktor S. Wold Eide, Frank Eliassen, Olav Lysne
GRID
2006
Springer
13 years 7 months ago
Fault-aware scheduling for Bag-of-Tasks applications on Desktop Grids
Desktop Grids have proved to be a suitable platform for the execution of Bag-of-Tasks applications but, being characterized by a high resource volatility, require the availability ...
Cosimo Anglano, John Brevik, Massimo Canonico, Dan...
STOC
2006
ACM
134views Algorithms» more  STOC 2006»
14 years 7 months ago
Byzantine agreement in the full-information model in O(log n) rounds
We present a randomized Byzantine Agreement (BA) protocol with an expected running time of O(log n) rounds, in a synchronous full-information network of n players. For any constan...
Michael Ben-Or, Elan Pavlov, Vinod Vaikuntanathan
VL
2009
IEEE
175views Visual Languages» more  VL 2009»
14 years 2 months ago
TurKit: Tools for iterative tasks on mechanical turk
Mechanical Turk (MTurk) is an increasingly popular web service for paying people small rewards to do human computation tasks. Current uses of MTurk typically post independent para...
Greg Little, Lydia B. Chilton, Max Goldman, Robert...
LCN
2008
IEEE
14 years 1 months ago
Constructing low-latency overlay networks: Tree vs. mesh algorithms
Abstract—Distributed interactive applications may have stringent latency requirements and dynamic user groups. These applications may benefit from a group communication system, ...
Knut-Helge Vik, Carsten Griwodz, Pål Halvors...