Sciweavers

158 search results - page 24 / 32
» Simple Fast Parallel Hashing
Sort
View
ICDCS
2010
IEEE
13 years 11 months ago
Practical Robust Communication in DHTs Tolerating a Byzantine Adversary
—There are several analytical results on distributed hash tables (DHTs) that can tolerate Byzantine faults. Unfortunately, in such systems, operations such as data retrieval and ...
Maxwell Young, Aniket Kate, Ian Goldberg, Martin K...
IROS
2007
IEEE
169views Robotics» more  IROS 2007»
14 years 1 months ago
A lightweight SLAM algorithm using Orthogonal planes for indoor mobile robotics
— Simple, fast and lightweight SLAM algorithms are necessary in many embedded robotic systems which soon will be used in houses and offices in order to do various service tasks....
Viet Nguyen, Ahad Harati, Roland Siegwart
IPPS
2009
IEEE
14 years 2 months ago
Coupled placement in modern data centers
We introduce the coupled placement problem for modern data centers spanning placement of application computation and data among available server and storage resources. While the t...
Madhukar R. Korupolu, Aameek Singh, Bhuvan Bamba
HPCA
2003
IEEE
14 years 7 months ago
Hierarchical Backoff Locks for Nonuniform Communication Architectures
This paper identifies node affinity as an important property for scalable general-purpose locks. Nonuniform communication architectures (NUCAs), for example CCNUMAs built from a f...
Zoran Radovic, Erik Hagersten
ICC
2007
IEEE
122views Communications» more  ICC 2007»
14 years 1 months ago
Evaluation of Clipped-OFDM and SC/FDE Alternatives for Block Transmission Using Iterative Receiver Techniques
— A CP-assisted (Cyclic Prefix) block transmission is widely accepted as a good choice for future mobile systems, taking advantage of low-cost, flexible, FFT-based (Fast Fourie...
Paulo Torres, António Gusmão