Sciweavers

1381 search results - page 40 / 277
» Fast Filtered Sampling
Sort
View
76
Voted
VVS
1998
IEEE
91views Visualization» more  VVS 1998»
15 years 2 months ago
Design of Accurate and Smooth Filters for Function and Derivative Reconstruction
The correct choice of function and derivative reconstruction filters is paramount to obtaining highly accurate renderings. Most filter choices are limited to a set of commonly use...
Torsten Möller, Klaus Mueller, Yair Kurzion, ...
UAI
2000
14 years 11 months ago
Rao-Blackwellised Particle Filtering for Dynamic Bayesian Networks
Particle filters (PFs) are powerful samplingbased inference/learning algorithms for dynamic Bayesian networks (DBNs). They allow us to treat, in a principled way, any type of prob...
Arnaud Doucet, Nando de Freitas, Kevin P. Murphy, ...
163
Voted
ISQED
2007
IEEE
372views Hardware» more  ISQED 2007»
15 years 4 months ago
From Finance to Flip Flops: A Study of Fast Quasi-Monte Carlo Methods from Computational Finance Applied to Statistical Circuit
Problems in computational finance share many of the characteristics that challenge us in statistical circuit analysis: high dimensionality, profound nonlinearity, stringent accura...
Amith Singhee, Rob A. Rutenbar
ICCAD
1998
IEEE
75views Hardware» more  ICCAD 1998»
15 years 2 months ago
A fast, accurate, and non-statistical method for fault coverage estimation
We present a fast, dynamic fault coverage estimation technique for sequential circuits that achieves high degrees of accuracy by signi cantly reducing the number of injected fault...
Michael S. Hsiao
ISBI
2009
IEEE
15 years 5 months ago
Fast Algorithms for Nonconvex Compressive Sensing: MRI Reconstruction from Very Few Data
Compressive sensing is the reconstruction of sparse images or signals from very few samples, by means of solving a tractable optimization problem. In the context of MRI, this can ...
Rick Chartrand