Sciweavers

1439 search results - page 81 / 288
» Fast approximation of centrality
Sort
View
SSWMC
2004
14 years 11 months ago
Fast additive noise steganalysis
This work reduces the computational requirements of the additive noise steganalysis presented by Harmsen and Pearlman. The additive noise model assumes that the stegoimage is crea...
Jeremiah J. Harmsen, Kevin D. Bowers, William A. P...
VMV
2004
165views Visualization» more  VMV 2004»
14 years 11 months ago
Fast and Accurate Ray-Voxel Intersection Techniques for Iso-Surface Ray Tracing
Visualizing iso-surfaces of volumetric data sets is becoming increasingly important for many practical applications. One crucial task in iso-surface ray tracing is to find the cor...
Gerd Marmitt, Andreas Kleer, Ingo Wald, Heiko Frie...
WSCG
2000
164views more  WSCG 2000»
14 years 11 months ago
Color-Table Animation of Fast Oriented Line Integral Convolution for Vector Field Visualization
Fast Oriented Line Integral Convolution (FROLIC), which is a variant of LIC, illustrates 2D vector fields by approximating a streamlet by a set of disks with varying intensity. FR...
Siegrun Berger, Eduard Gröller
CORR
2010
Springer
253views Education» more  CORR 2010»
14 years 10 months ago
Fast Inference in Sparse Coding Algorithms with Applications to Object Recognition
Adaptive sparse coding methods learn a possibly overcomplete set of basis functions, such that natural image patches can be reconstructed by linearly combining a small subset of t...
Koray Kavukcuoglu, Marc'Aurelio Ranzato, Yann LeCu...
DM
2006
91views more  DM 2006»
14 years 10 months ago
Fast perfect sampling from linear extensions
In this paper, we study the problem of sampling (exactly) uniformly from the set of linear extensions of an arbitrary partial order. Previous Markov chain techniques have yielded ...
Mark Huber