2520 search results - page 111 / 504 » The complexity of approximating entropy |
PR
2007
14 years 10 months ago
2007
In this paper, we propose a novel image denoising method by incorporating the dual-tree complex wavelets into the ordinary ridgelet transform. The approximate shift invariant prop...
83
Voted
ICIP
2002
IEEE
15 years 12 months ago
2002
IEEE
Transform approximations are explored for speeding up the software compression of images and video. Faster approximations are used to replace the regular DCT whenever only few DCT...
PODS
2008
ACM
15 years 10 months ago
2008
ACM
Co-clustering is the simultaneous partitioning of the rows and columns of a matrix such that the blocks induced by the row/column partitions are good clusters. Motivated by severa...
ICMCS
2006
IEEE
15 years 4 months ago
2006
IEEE
This paper proposes an effective method for converting any fast DCT algorithm into an approximate multiplierless version. Basically it approximates any constant in the original tr...
AAAI
2008
15 years 21 days ago
2008
We propose a novel method for approximate inference in Bayesian networks (BNs). The idea is to sample data from a BN, learn a latent tree model (LTM) from the data offline, and wh...