Sciweavers

5329 search results - page 65 / 1066
» The Weighted Majority Algorithm
Sort
View
STOC
2002
ACM
112views Algorithms» more  STOC 2002»
14 years 8 months ago
Wait-free consensus with infinite arrivals
A randomized algorithm is given that solves the wait-free consensus problem for a shared-memory model with infinitely many processes. The algorithm is based on a weak shared coin ...
James Aspnes, Gauri Shah, Jatin Shah
TON
2002
138views more  TON 2002»
13 years 7 months ago
Algebra and algorithms for QoS path computation and hop-by-hop routing in the internet
Prompted by the advent of quality-of-service routing in the Internet, we investigate the properties that path weight functions must have so that hop-by-hop routing is possible and ...
João L. Sobrinho
ICASSP
2011
IEEE
12 years 11 months ago
A multi-exposure image fusion algorithm without ghost effect
This paper proposes a new multi-exposure fusion algorithm for HDR imaging. The advantage of the fusion based method is that it does not actually generate HDR images so that the co...
Jaehyun An, Sang Heon Lee, Jung Gap Kuk, Nam Ik Ch...
SODA
2008
ACM
127views Algorithms» more  SODA 2008»
13 years 9 months ago
Nondecreasing paths in a weighted graph or: how to optimally read a train schedule
A travel booking office has timetables giving arrival and departure times for all scheduled trains, including their origins and destinations. A customer presents a starting city a...
Virginia Vassilevska
CPC
2007
97views more  CPC 2007»
13 years 7 months ago
On an Online Spanning Tree Problem in Randomly Weighted Graphs
Abstract. This paper is devoted to an online variant of the minimum spanning tree problem in randomly weighted graphs. We assume that the input graph is complete and the edge weigh...
Jan Remy, Alexander Souza, Angelika Steger