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 ...
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 ...
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...
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...
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...