Sciweavers

746 search results - page 31 / 150
» Fast (Structured) Newton Computations
Sort
View
DSSCV
2005
Springer
14 years 1 months ago
Exploiting Deep Structure
Abstract. Blurring an image with a Gaussian of width σ and considering σ as an extra dimension, extends the image to an Gaussian scale space (GSS) image. In this GSS-image the is...
Arjan Kuijper
SSDBM
2007
IEEE
127views Database» more  SSDBM 2007»
14 years 2 months ago
A Fast Algorithm for Approximate Quantiles in High Speed Data Streams
We present a fast algorithm for computing approximate quantiles in high speed data streams with deterministic error bounds. For data streams of size N where N is unknown in advanc...
Qi Zhang, Wei Wang 0010
CGI
2004
IEEE
13 years 11 months ago
Fast and High Quality Overlap Repair for Patch-Based Texture Synthesis
Patch-based texture synthesis has proven to produce high quality textures faster than pixel-based approaches. Previous algorithms differ in how the regions of overlap between neig...
Andrew Nealen, Marc Alexa
EGH
2009
Springer
13 years 5 months ago
Fast minimum spanning tree for large graphs on the GPU
Graphics Processor Units are used for many general purpose processing due to high compute power available on them. Regular, data-parallel algorithms map well to the SIMD architect...
Vibhav Vineet, Pawan Harish, Suryakant Patidar, P....
SIGGRAPH
1994
ACM
13 years 11 months ago
A fast shadow algorithm for area light sources using backprojection
The fast identification of shadow regions due to area light sources is necessary for realistic rendering and for discontinuity meshing for global illumination. A new shadow-determ...
George Drettakis, Eugene Fiume