Sciweavers

2913 search results - page 229 / 583
» How Much to Copy
Sort
View
97
Voted
WADS
2007
Springer
145views Algorithms» more  WADS 2007»
15 years 7 months ago
Approximate Shortest Paths Guided by a Small Index
Distance oracles and graph spanners are excerpts of a graph that allow to compute approximate shortest paths. Here, we consider the situation where it is possible to access the ori...
Jörg Derungs, Riko Jacob, Peter Widmayer
MOBICOM
2006
ACM
15 years 6 months ago
A software architecture for physical layer wireless network emulation
Despite their widespread deployment, many aspects of wireless network performance are poorly understood, and there is great room from improvement in wireless network reliability a...
Glenn Judd, Peter Steenkiste
IPPS
2005
IEEE
15 years 6 months ago
A Case Study on Pattern-Based Systems for High Performance Computational Biology
Computational biology research is now faced with the burgeoning number of genome data. The rigorous postprocessing of this data requires an increased role for high performance com...
Weiguo Liu, Bertil Schmidt
86
Voted
ASIAN
2005
Springer
150views Algorithms» more  ASIAN 2005»
15 years 6 months ago
ACB-R: An Adaptive Clustering-Based Data Replication Algorithm on a P2P Data-Store
Replication on geographically distributed, unreliable, P2P interconnecting nodes can offer high data availability and low network latency for replica access. The challenge is how ...
Junhu Zhang, Dongqing Yang, Shiwei Tang
HIPC
2005
Springer
15 years 6 months ago
Application of Reduce Order Modeling to Time Parallelization
We recently proposed a new approach to parallelization, by decomposing the time domain, instead of the conventional space domain. This improves latency tolerance, and we demonstrat...
Ashok Srinivasan, Yanan Yu, Namas Chandra