Sciweavers

6181 search results - page 1005 / 1237
» Transactional Cluster Computing
Sort
View
STOC
2010
ACM
295views Algorithms» more  STOC 2010»
15 years 9 months ago
Approximation Schemes for Steiner Forest on Planar Graphs and Graphs of Bounded Treewidth
We give the first polynomial-time approximation scheme (PTAS) for the Steiner forest problem on planar graphs and, more generally, on graphs of bounded genus. As a first step, w...
MohammadHossein Bateni, MohammadTaghi Hajiaghayi a...
ICS
2009
Tsinghua U.
15 years 9 months ago
A translation system for enabling data mining applications on GPUs
Modern GPUs offer much computing power at a very modest cost. Even though CUDA and other related recent developments are accelerating the use of GPUs for general purpose applicati...
Wenjing Ma, Gagan Agrawal
HPCA
2000
IEEE
15 years 9 months ago
Evaluation of Active Disks for Decision Support Databases
Growth and usage trends for large decision support databases indicate that there is a need for architectures that scale the processing power as the dataset grows. To meet this nee...
Mustafa Uysal, Anurag Acharya, Joel H. Saltz
141
Voted
PODC
2000
ACM
15 years 9 months ago
Garbage collection of timestamped data in Stampede
Stampede is a parallel programming system to facilitate the programming of interactive multimedia applications on clusters of SMPs. In a Stampede application, a variable number of...
Rishiyur S. Nikhil, Umakishore Ramachandran
SIGGRAPH
1997
ACM
15 years 9 months ago
Interactive update of global illumination using a line-space hierarchy
Interactively manipulating the geometry of complex, globally illuminated scenes has to date proven an elusive goal. Previous attempts have failed to provide interactive updates of...
George Drettakis, François X. Sillion
« Prev « First page 1005 / 1237 Last » Next »