Sciweavers

2297 search results - page 420 / 460
» Distributed computation of virtual coordinates
Sort
View
GRID
2003
Springer
15 years 5 months ago
Faults in Grids: Why are they so bad and What can be done about it?
Computational Grids have the potential to become the main execution platform for high performance and distributed applications. However, such systems are extremely complex and pro...
Raissa Medeiros, Walfredo Cirne, Francisco Vilar B...
SWAT
2000
Springer
90views Algorithms» more  SWAT 2000»
15 years 3 months ago
Efficient Expected-Case Algorithms for Planar Point Location
Planar point location is among the most fundamental search problems in computational geometry. Although this problem has been heavily studied from the perspective of worst-case que...
Sunil Arya, Siu-Wing Cheng, David M. Mount, Ramesh...
NSDI
2004
15 years 1 months ago
Designing a DHT for Low Latency and High Throughput
Designing a wide-area distributed hash table (DHT) that provides high-throughput and low-latency network storage is a challenge. Existing systems have explored a range of solution...
Frank Dabek, Jinyang Li, Emil Sit, James Robertson...
3DOR
2008
15 years 28 days ago
A 3D Face Recognition Algorithm Using Histogram-based Features
We present an automatic face recognition approach, which relies on the analysis of the three-dimensional facial surface. The proposed approach consists of two basic steps, namely ...
Xuebing Zhou, Helmut Seibert, Christoph Busch, Wol...
SIGCOMM
2010
ACM
15 years 11 hour ago
Symbiotic routing in future data centers
Building distributed applications for data centers is hard. CamCube explores whether replacing the traditional switchbased network with a directly connected topology makes it easi...
Hussam Abu-Libdeh, Paolo Costa, Antony I. T. Rowst...