Sciweavers

178 search results - page 4 / 36
» Dynamic Data Replication based on Local Optimization Princip...
Sort
View
WSC
2004
13 years 7 months ago
A Near Optimal Approach to Quality of Service Data Replication Scheduling
This paper describes an approach to real-time decisionmaking for quality of service based scheduling of distributed asynchronous data replication. The proposed approach addresses ...
Kevin Adams, Denis Gracanin, Dusan Teodorovic
TIP
2008
208views more  TIP 2008»
13 years 5 months ago
Vision Processing for Realtime 3-D Data Acquisition Based on Coded Structured Light
Structured light vision systems have been successfully used for accurate measurement of 3-D surfaces in computer vision. However, their applications are mainly limited to scanning ...
S. Y. Chen, Y. F. Li, Jianwei Zhang
PRL
2006
139views more  PRL 2006»
13 years 5 months ago
Adaptive Hausdorff distances and dynamic clustering of symbolic interval data
This paper presents a partitional dynamic clustering method for interval data based on adaptive Hausdorff distances. Dynamic clustering algorithms are iterative two-step relocatio...
Francisco de A. T. de Carvalho, Renata M. C. R. de...
GCC
2005
Springer
13 years 11 months ago
Incorporating Data Movement into Grid Task Scheduling
Task Scheduling is a critical design issue of distributed computing. The emerging Grid computing infrastructure consists of heterogeneous resources in widely distributed autonomous...
Xiaoshan He, Xian-He Sun
ISPDC
2006
IEEE
14 years 5 hour ago
How to Achieve High Throughput with Dynamic Tree-Structured Coterie
Data replication permits a better network bandwidth utilization and minimizes the effect of latency in large-scale systems such as computing grids. However, the cost of maintainin...
Ivan Frain, Abdelaziz Mzoughi, Jean Paul Bahsoun