Sciweavers

2570 search results - page 190 / 514
» Fast Algorithms For The Computation Of Ranklets
Sort
View
SIGGRAPH
2000
ACM
15 years 10 months ago
A fast relighting engine for interactive cinematic lighting design
We present new techniques for interactive cinematic lighting design of complex scenes that use procedural shaders. Deep-framebuffers are used to store the geometric and optical in...
Reid Gershbein, Pat Hanrahan
CF
2010
ACM
15 years 9 months ago
Towards chip-on-chip neuroscience: fast mining of neuronal spike streams using graphics hardware
Computational neuroscience is being revolutionized with the advent of multi-electrode arrays that provide real-time, dynamic perspectives into brain function. Mining neuronal spik...
Yong Cao, Debprakash Patnaik, Sean P. Ponce, Jerem...
CORR
2010
Springer
109views Education» more  CORR 2010»
15 years 6 months ago
Fast space-variant elliptical filtering using box splines
The efficient realization of linear space-variant (non-convolution) filters is a challenging computational problem in image processing. In this paper, we demonstrate that it is po...
Kunal Narayan Chaudhury, Arrate Muñoz-Barru...
SDM
2011
SIAM
414views Data Mining» more  SDM 2011»
14 years 9 months ago
Clustered low rank approximation of graphs in information science applications
In this paper we present a fast and accurate procedure called clustered low rank matrix approximation for massive graphs. The procedure involves a fast clustering of the graph and...
Berkant Savas, Inderjit S. Dhillon
VRST
2005
ACM
16 years 16 hour ago
Artistic reality: fast brush stroke stylization for augmented reality
The goal of augmented reality is to provide the user with a view of the surroundings enriched by virtual objects. Practically all augmented reality systems rely on standard realti...
Jan Fischer, Dirk Bartz, Wolfgang Straßer