Sciweavers

89 search results - page 11 / 18
» Fast Byzantine Consensus
Sort
View
ICDAR
2007
IEEE
15 years 6 months ago
Robust Circle Detection
In this paper we present a method of robustly detect circles in a line drawing image. The method is fast, robust and very reliable, and is capable of assessing the quality of its ...
Bart Lamiroy, Laurent Fritz, Olivier Gaucher
92
Voted
AUTOMATICA
2008
104views more  AUTOMATICA 2008»
15 years 15 days ago
Communication constraints in the average consensus problem
The interrelationship between control and communication theory is becoming of fundamental importance in many distributed control systems, such as the coordination of a team of aut...
Ruggero Carli, Fabio Fagnani, Alberto Speranzon, S...
118
Voted
TCBB
2011
14 years 7 months ago
Accurate Construction of Consensus Genetic Maps via Integer Linear Programming
—We study the problem of merging genetic maps, when the individual genetic maps are given as directed acyclic graphs. The computational problem is to build a consensus map, which...
Yonghui Wu, Timothy J. Close, Stefano Lonardi
109
Voted
DC
2007
15 years 11 days ago
The overhead of consensus failure recovery
Abstract Many reliable distributed systems are consensusbased and typically operate under two modes: a fast normal mode in failure-free synchronous periods, and a slower recovery m...
Partha Dutta, Rachid Guerraoui, Idit Keidar
102
Voted
ICRA
2009
IEEE
259views Robotics» more  ICRA 2009»
15 years 7 months ago
Fast Point Feature Histograms (FPFH) for 3D registration
— In our recent work [1], [2], we proposed Point Feature Histograms (PFH) as robust multi-dimensional features which describe the local geometry around a point p for 3D point clo...
Radu Bogdan Rusu, Nico Blodow, Michael Beetz