Sciweavers

795 search results - page 57 / 159
» On the value of threshold signatures
Sort
View
ICML
1997
IEEE
15 years 10 months ago
A Comparative Study on Feature Selection in Text Categorization
This paper is a comparative study of feature selection methods in statistical learning of text categorization. The focus is on aggressive dimensionality reduction. Five methods we...
Yiming Yang, Jan O. Pedersen
TVLSI
2008
197views more  TVLSI 2008»
15 years 6 months ago
Leakage Minimization of SRAM Cells in a Dual-Vt and Dual-Tox Technology
-- Aggressive CMOS scaling results in low threshold voltage and thin oxide thickness for transistors manufactured in deep submicron regime. As a result, reducing the subthreshold a...
Behnam Amelifard, Farzan Fallah, Massoud Pedram
TASLP
2010
118views more  TASLP 2010»
15 years 4 months ago
Time-Frequency Sparsity by Removing Perceptually Irrelevant Components Using a Simple Model of Simultaneous Masking
Abstract—We present an algorithm for removing timefrequency components, found by a standard Gabor transform, of a “real-world” sound while causing no audible difference to th...
Péter Balázs, Bernhard Laback, Gerha...
SIGMOD
2002
ACM
134views Database» more  SIGMOD 2002»
16 years 6 months ago
Wavelet synopses with error guarantees
Recent work has demonstrated the effectiveness of the wavelet decomposition in reducing large amounts of data to compact sets of wavelet coefficients (termed "wavelet synopse...
Minos N. Garofalakis, Phillip B. Gibbons
APPROX
2010
Springer
213views Algorithms» more  APPROX 2010»
15 years 7 months ago
Constructive Proofs of Concentration Bounds
We give a simple combinatorial proof of the Chernoff-Hoeffding concentration bound [Che52, Hoe63], which says that the sum of independent {0, 1}-valued random variables is highly ...
Russell Impagliazzo, Valentine Kabanets