Sciweavers

6045 search results - page 1161 / 1209
» Computable Linearizations of Well-partial-orderings
Sort
View
TCS
2008
13 years 7 months ago
Smooth words on 2-letter alphabets having same parity
In this paper, we consider smooth words over 2-letter alphabets {a, b}, where a, b are integers having same parity, with 0 < a < b. We show that all are recurrent and that t...
Srecko Brlek, Damien Jamet, Geneviève Paqui...
IS
2007
13 years 7 months ago
Discovering frequent geometric subgraphs
As data mining techniques are being increasingly applied to non-traditional domains, existing approaches for finding frequent itemsets cannot be used as they cannot model the req...
Michihiro Kuramochi, George Karypis
ISCI
2007
99views more  ISCI 2007»
13 years 7 months ago
Privacy-preserving algorithms for distributed mining of frequent itemsets
Standard algorithms for association rule mining are based on identification of frequent itemsets. In this paper, we study how to maintain privacy in distributed mining of frequen...
Sheng Zhong
TIP
2008
127views more  TIP 2008»
13 years 7 months ago
SURE-LET Multichannel Image Denoising: Interscale Orthonormal Wavelet Thresholding
Abstract--We propose a vector/matrix extension of our denoising algorithm initially developed for grayscale images, in order to efficiently process multichannel (e.g., color) image...
Florian Luisier, Thierry Blu
TIT
2008
73views more  TIT 2008»
13 years 7 months ago
L-CAMP: Extremely Local High-Performance Wavelet Representations in High Spatial Dimension
A new wavelet-based methodology for representing data on regular grids is introduced and studied. The main attraction of this new L-CAMP methodology is in the way it scales with th...
Youngmi Hur, Amos Ron
« Prev « First page 1161 / 1209 Last » Next »