2168 search results - page 402 / 434 » Using Approximation Hardness to Achieve Dependable Computati... |
WG
2010
Springer
13 years 6 months ago
2010
Springer
Θk-graphs are geometric graphs that appear in the context of graph navigation. The shortest-path metric of these graphs is known to approximate the Euclidean complete graph up to...
ASPLOS
2009
ACM
14 years 8 months ago
2009
ACM
Even though graphics processors (GPUs) are becoming increasingly popular for general purpose computing, current (and likely near future) generations of GPUs do not provide hardwar...
IEEEPACT
2006
IEEE
14 years 1 months ago
2006
IEEE
Packet forwarding is a memory-intensive application requiring multiple accesses through a trie structure. The efficiency of a cache for this application critically depends on the ...
GRAPHITE
2006
ACM
14 years 1 months ago
2006
ACM
This paper presents a two-stage compression method for accelerating GPU-based volume rendering of time-varying scalar data. Our method aims at reducing transfer time by compressin...
SIGUCCS
2003
ACM
14 years 29 days ago
2003
ACM
The Ringling School of Art and Design is a fully accredited four year college of visual art and design with a student population of approximately 1000. The Ringling School has ach...