6343 search results - page 105 / 1269 » Robust consensus computation |
169
click to vote
HPDC
2005
IEEE
15 years 9 months ago
2005
IEEE
Scheduling strategies for parallel and distributed computing have mostly been oriented toward performance, while striving to achieve some notion of fairness. With the increase in ...
123
click to vote
CGI
2004
IEEE
15 years 7 months ago
2004
IEEE
We present a new algorithm for computing a polygonal surface from a union of balls. The method computes and connects the singular points of a given union of balls in an efficient ...
131
click to vote
COMPGEOM
2001
ACM
15 years 7 months ago
2001
ACM
We present an approximation algorithm for computing the diameter of a point-set in d-dimensions. The new algorithm is sensitive to the "hardness" of computing the diamet...
140
click to vote
ICMS
2010
15 years 2 months ago
2010
We summarize recent progress and on-going developments for exact geometric and algebraic computations within the Computational Geometry Algorithms Library (Cgal). We detail the exi...
116
click to vote
STACS
2005
Springer
15 years 9 months ago
2005
Springer
We define and study the complexity of robust polynomials for Boolean functions and the related fault-tolerant quantum decision trees, where input bits are perturbed by noise. We ...