Sciweavers

1381 search results - page 43 / 277
» Fast Filtered Sampling
Sort
View
WSCG
2003
145views more  WSCG 2003»
14 years 11 months ago
Real-Time Soft Shadows Using a Single Light Sample
We present a real-time rendering algorithm that generates soft shadows of dynamic scenes using a single light sample. As a depth-map algorithm it can handle arbitrary shadowed sur...
Florian Kirsch, Jürgen Döllner
89
Voted
SIGMOD
2003
ACM
172views Database» more  SIGMOD 2003»
15 years 10 months ago
Dynamic Sample Selection for Approximate Query Processing
In decision support applications, the ability to provide fast approximate answers to aggregation queries is desirable. One commonly-used technique for approximate query answering ...
Brian Babcock, Surajit Chaudhuri, Gautam Das
77
Voted
DKE
2006
67views more  DKE 2006»
14 years 10 months ago
Indexed-based density biased sampling for clustering applications
Density biased sampling (DBS) has been proposed to address the limitations of Uniform sampling, by producing the desired probability distribution in the sample. The ease of produc...
Alexandros Nanopoulos, Yannis Theodoridis, Yannis ...
136
Voted
IV
2006
IEEE
210views Visualization» more  IV 2006»
15 years 4 months ago
FFT and Convolution Performance in Image Filtering on GPU
Many contemporary visualization tools comprise some image filtering approach. Since image filtering approaches are very computationally demanding, the acceleration using graphic...
Ondirej Fialka, Martin Cadík
109
Voted
FOCM
2008
156views more  FOCM 2008»
14 years 10 months ago
Random Sampling of Sparse Trigonometric Polynomials, II. Orthogonal Matching Pursuit versus Basis Pursuit
We investigate the problem of reconstructing sparse multivariate trigonometric polynomials from few randomly taken samples by Basis Pursuit and greedy algorithms such as Orthogona...
Stefan Kunis, Holger Rauhut