Sciweavers

1277 search results - page 13 / 256
» Terminating Decision Algorithms Optimally
Sort
View
76
Voted
SODA
2010
ACM
173views Algorithms» more  SODA 2010»
15 years 7 months ago
Distributed Agreement with Optimal Communication Complexity
We consider the problem of fault-tolerant agreement in a crash-prone synchronous system. We present a new randomized consensus algorithm that achieves optimal communication effici...
Seth Gilbert, Dariusz Kowalski
STOC
2007
ACM
92views Algorithms» more  STOC 2007»
15 years 9 months ago
Tight bounds for asynchronous randomized consensus
A distributed consensus algorithm allows n processes to reach a common decision value starting from individual inputs. Wait-free consensus, in which a process always terminates wi...
Hagit Attiya, Keren Censor
WWW
2007
ACM
15 years 10 months ago
Robust web page segmentation for mobile terminal using content-distances and page layout information
The demand of browsing information from general Web pages using a mobile phone is increasing. However, since the majority of Web pages on the Internet are optimized for browsing f...
Gen Hattori, Keiichiro Hoashi, Kazunori Matsumoto,...
ICIP
2000
IEEE
15 years 1 months ago
Trellis-Based R-D Optimal Quantization in H.263+
Abstract—We describe a trellis-based algorithm which enables R-D optimum quantization decisions in the H.263+ video coding standard. The algorithm allows the quantization decisio...
Max H. Luttrell, Jiangtao Wen, John D. Villasenor
99
Voted
UAI
1998
14 years 11 months ago
Flexible Decomposition Algorithms for Weakly Coupled Markov Decision Problems
This paper presents two new approaches to decomposing and solving large Markov decision problems (MDPs), a partial decoupling method and a complete decoupling method. In these app...
Ronald Parr