Sciweavers

2020 search results - page 292 / 404
» Speeding up Slicing
Sort
View
FAST
2003
13 years 10 months ago
Pond: The OceanStore Prototype
OceanStore is an Internet-scale, persistent data store designed for incremental scalability, secure sharing, and long-term durability. Pond is the OceanStore prototype; it contain...
Sean C. Rhea, Patrick R. Eaton, Dennis Geels, Haki...
PDCN
2004
13 years 10 months ago
K-Means VQ algorithm using a low-cost parallel cluster computing
It is well-known that the time and memory necessary to create a codebook from large training databases have hindered the vector quantization based systems for real applications. T...
Paulo Sergio Lopes de Souza, Alceu de Souza Britto...
ICMLA
2003
13 years 10 months ago
Reinforcement Learning Task Clustering
This work represents the first step towards a task library system in the reinforcement learning domain. Task libraries could be useful in speeding up the learning of new tasks th...
James L. Carroll, Todd S. Peterson, Kevin D. Seppi
WSCG
2001
124views more  WSCG 2001»
13 years 10 months ago
Occlusion Evaluation in Hierarchical Radiosity
In any hierarchical radiosity method, the most expensive part is the evaluation of the visibility. Many methods use sampling and ray casting to determine this term. Space partitio...
Yann Dupuy, Mathias Paulin, René Caubet
WSC
2004
13 years 10 months ago
Towards Adaptive Caching for Parallel and Discrete Event Simulation
We investigate factors that impact the effectiveness of caching to speed up discrete event simulation. Walsh and Sirer have shown that a variant of function caching (staged simula...
Abhishek Chugh, Maria Hybinette