Sciweavers

1434 search results - page 142 / 287
» Distributed Computing with Imperfect Randomness
Sort
View
INFOCOM
2005
IEEE
14 years 3 months ago
Gossip algorithms: design, analysis and applications
Abstract— Motivated by applications to sensor, peer-topeer and ad hoc networks, we study distributed asynchronous algorithms, also known as gossip algorithms, for computation and...
Stephen P. Boyd, Arpita Ghosh, Balaji Prabhakar, D...
ICPR
2010
IEEE
14 years 6 days ago
Evaluation of a New Point Clouds Registration Method Based on Group Averaging Features
Registration of point clouds is required in the processing of large biological data sets. The tradeoff between computation time and accuracy of the registration is the main challen...
Maja Temerinac-Ott, Margret Keuper, Hans Burkhardt
TAPSOFT
1995
Springer
14 years 1 months ago
Anatomy of the Pentium Bug
The Pentium computer chip’s division algorithm relies on a table from which five entries were inadvertently omitted, with the result that 1738 single precision dividenddivisor ...
Vaughan R. Pratt
SODA
2010
ACM
176views Algorithms» more  SODA 2010»
14 years 7 months ago
Self-improving Algorithms for Convex Hulls
We describe an algorithm for computing planar convex hulls in the self-improving model: given a sequence I1, I2, . . . of planar n-point sets, the upper convex hull conv(I) of eac...
Kenneth L. Clarkson, Wolfgang Mulzer, C. Seshadhri
VLDB
2005
ACM
132views Database» more  VLDB 2005»
14 years 10 months ago
Hash-based labeling techniques for storage scaling
Scalable storage architectures allow for the addition or removal of storage devices to increase storage capacity and bandwidth or retire older devices. Assuming random placement of...
Shu-Yuen Didi Yao, Cyrus Shahabi, Per-Åke Larson