Sciweavers

6343 search results - page 98 / 1269
» Robust consensus computation
Sort
View
112
Voted
FOCS
1993
IEEE
15 years 4 months ago
A Tight Lower Bound for k-Set Agreement
: Weprove tight bounds on the time needed to solve k-set agreement, a natural generalization of consensus. We analyze this problem in a synchronous, message-passing model where pro...
Soma Chaudhuri, Maurice Herlihy, Nancy A. Lynch, M...
93
Voted
ICASSP
2010
IEEE
15 years 25 days ago
A general formalism for the analysis of distributed algorithms
The major contribution of this paper is the presentation of a general unifying description of distributed algorithms allowing to map local, node-based, algorithms onto a single gl...
Ondrej Sluciak, Thibault Hilaire, Markus Rupp
85
Voted
COLING
2010
14 years 7 months ago
Heterogeneous Parsing via Collaborative Decoding
There often exist multiple corpora for the same natural language processing (NLP) tasks. However, such corpora are generally used independently due to distinctions in annotation s...
Muhua Zhu, Jingbo Zhu, Tong Xiao
98
Voted
ACL
2011
14 years 4 months ago
Neutralizing Linguistically Problematic Annotations in Unsupervised Dependency Parsing Evaluation
Dependency parsing is a central NLP task. In this paper we show that the common evaluation for unsupervised dependency parsing is highly sensitive to problematic annotations. We s...
Roy Schwartz, Omri Abend, Roi Reichart, Ari Rappop...
ICRA
2000
IEEE
109views Robotics» more  ICRA 2000»
15 years 5 months ago
Computing the Sensory Uncertainty Field of a Vision-Based Localization Sensor
—Recently it has been recognized that robust motion planners should take into account the varying performance of localization sensors across the configuration space. Although a n...
Amit Adam, Ehud Rivlin, Ilan Shimshoni