113 search results - page 14 / 23 » Symmetry Breaking |
ICARCV
2002
IEEE
15 years 2 months ago
2002
IEEE
Although the least median of squares (LMedS) method and the least trimmed squares (LTS) method are said to have a high breakdown point (50%), they can break down at unexpectedly l...
CP
2010
Springer
14 years 8 months ago
2010
Springer
Abstract. Rambo is the Reconfigurable Atomic Memory for Basic Objects, a formally specified algorithm that implements atomic read/write shared memory in dynamic networks, where t...
AMAI
2005
Springer
14 years 9 months ago
2005
Springer
Mediator systems integrate distributed, heterogeneous and autonomous data sources, but their e ective use requires the solution of hard query optimization problems. This is usuall...
138
click to vote
PODC
2011
ACM
14 years 8 days ago
2011
ACM
A maximal independent set on a graph is an inclusion-maximal set of mutually non-adjacent nodes. This basic symmetry breaking structure is vital for many distributed algorithms, w...
FOCS
2006
IEEE
15 years 3 months ago
2006
IEEE
We establish the exact threshold for the reconstruction problem for a binary asymmetric channel on the b-ary tree, provided that the asymmetry is sufficiently small. This is the ...