Sciweavers

1541 search results - page 140 / 309
» Analysis of Random Noise and Random Walk Algorithms
Sort
View
SIGGRAPH
1991
ACM
15 years 8 months ago
Spectrally optimal sampling for distribution ray tracing
Nonuniform sampling of images is a useful technique in computer graphics, because a properly designed pattern of samples can make aliasing take the form of high-frequency random n...
Don P. Mitchell
CVPR
2007
IEEE
16 years 7 months ago
Groupwise Shape Registration on Raw Edge Sequence via A Spatio-Temporal Generative Model
Groupwise shape registration of raw edge sequence is addressed. Automatically extracted edge maps are treated as noised input shape of the deformable object and their registration...
Huijun Di, Rao Naveed Iqbal, Guangyou Xu, Linmi Ta...
SDM
2009
SIAM
157views Data Mining» more  SDM 2009»
16 years 2 months ago
MUSK: Uniform Sampling of k Maximal Patterns.
Recent research in frequent pattern mining (FPM) has shifted from obtaining the complete set of frequent patterns to generating only a representative (summary) subset of frequent ...
Mohammad Al Hasan, Mohammed Javeed Zaki
SODA
2008
ACM
144views Algorithms» more  SODA 2008»
15 years 6 months ago
Fast dimension reduction using Rademacher series on dual BCH codes
The Fast Johnson-Lindenstrauss Transform (FJLT) was recently discovered by Ailon and Chazelle as a novel technique for performing fast dimension reduction with small distortion fr...
Nir Ailon, Edo Liberty
ISSAC
2007
Springer
94views Mathematics» more  ISSAC 2007»
15 years 11 months ago
Faster algorithms for the characteristic polynomial
A new randomized algorithm is presented for computing the characteristic polynomial of an n × n matrix over a field. Over a sufficiently large field the asymptotic expected com...
Clément Pernet, Arne Storjohann