Sciweavers

4908 search results - page 369 / 982
» On the Complexity of Optimal K-Anonymity
Sort
View
ICIP
2010
IEEE
15 years 4 months ago
Fast bilateral filtering by adapting block size
Direct implementations of bilateral filtering show O(r2 ) computational complexity per pixel, where r is the filter window radius. Several lower complexity methods have been devel...
Wei Yu, Franz Franchetti, James C. Hoe, Yao-Jen Ch...
ICIP
2004
IEEE
16 years 8 months ago
Feature-based intra-prediction mode decision for H.264
A fast mode decision method for Intra prediction in H.264 is proposed in this work to reduce the encoder complexity. The proposed algorithm adopts a multi-stage sequential mode de...
Changsung Kim, Hsuan-Huei Shih, C. C. Jay Kuo
ICPR
2006
IEEE
16 years 8 months ago
Simultaneous Image Denoising and Compression by Multiscale 2D Tensor Voting
In this paper we propose a method that simultaneously performs image denoising and compression by using multiscale tensor voting. Given a real color image, the pixels are first co...
Yu-Wing Tai, Wai-Shun Tong, Chi-Keung Tang
DAC
2008
ACM
16 years 7 months ago
Predictive design space exploration using genetically programmed response surfaces
Exponential increases in architectural design complexity threaten to make traditional processor design optimization techniques intractable. Genetically programmed response surface...
Henry Cook, Kevin Skadron
KDD
2006
ACM
150views Data Mining» more  KDD 2006»
16 years 7 months ago
Maximally informative k-itemsets and their efficient discovery
In this paper we present a new approach to mining binary data. We treat each binary feature (item) as a means of distinguishing two sets of examples. Our interest is in selecting ...
Arno J. Knobbe, Eric K. Y. Ho