Sciweavers

2570 search results - page 213 / 514
» Fast Algorithms For The Computation Of Ranklets
Sort
View
VIS
2007
IEEE
188views Visualization» more  VIS 2007»
16 years 5 months ago
Fast Filament Tracking Using Graphics Hardware
Recent developments in biomedical imaging are producing massive data sets containing structures, such as fine filaments, that are difficult to visualize. In this paper, we describ...
David M. Mayerich, Zeki Melek, John Keyser
GRAPHITE
2006
ACM
15 years 10 months ago
Two-stage compression for fast volume rendering of time-varying scalar data
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...
Daisuke Nagayasu, Fumihiko Ino, Kenichi Hagihara
SDM
2009
SIAM
138views Data Mining» more  SDM 2009»
16 years 1 months ago
ShatterPlots: Fast Tools for Mining Large Graphs.
Graphs appear in several settings, like social networks, recommendation systems, computer communication networks, gene/protein biological networks, among others. A deep, recurring...
Ana Paula Appel, Andrew Tomkins, Christos Faloutso...
EUROGRAPHICS
2010
Eurographics
16 years 1 months ago
Electors Voting for Fast Automatic Shape Correspondence
This paper challenges the difficult problem of automatic semantic correspondence between two given shapes which are semantically similar but possibly geometrically very different...
Oscar Kin-Chung Au, Chiew-Lan Tai, Daniel Cohen-Or...
CGO
2008
IEEE
15 years 10 months ago
Fast liveness checking for ssa-form programs
Liveness analysis is an important analysis in optimizing compilers. Liveness information is used in several optimizations and is mandatory during the code-generation phase. Two dr...
Benoit Boissinot, Sebastian Hack, Daniel Grund, Be...