124 search results - page 10 / 25 » Dynamic Function Placement for Data-Intensive Cluster Comput... |
HPCA
2002
IEEE
15 years 9 months ago
2002
IEEE
Clusters of high-end workstations and PCs are currently used in many application domains to perform large-scale computations or as scalable servers for I/O bound tasks. Although c...
ICCS
2004
Springer
15 years 2 months ago
2004
Springer
We present an incremental tree editor based on algorithms for manipulating shape functions. The tree layout is hierarchical, left-to-right. Nodes of variable size and shape are sup...
CF
2004
ACM
15 years 2 months ago
2004
ACM
Network attached disk storage is characterized by independent network attachment and embedded intelligence. For Internet applications, it provides the key functionality of geograp...
100
click to vote
ICNP
2003
IEEE
15 years 2 months ago
2003
IEEE
Abstract—In the paper, we devise and evaluate a fully decentralized, light-weight, dynamic clustering algorithm for target tracking. Instead of assuming the same role for all the...
PG
2007
IEEE
15 years 3 months ago
2007
IEEE
This paper presents a novel PRT-based method that uses precomputed visibility cuts for interactive relighting with all-frequency environment maps and arbitrary dynamic BRDFs. Our ...