3006 search results - page 265 / 602 » Dimensionality reduction and generalization |
173
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
Sparsity in the eigenspace of signal covariance matrices is exploited in this paper for compression and denoising. Dimensionality reduction (DR) and quantization modules present i...
215
click to vote
JMLR
2012
13 years 9 months ago
2012
Traditional tensor decompositions such as the CANDECOMP / PARAFAC (CP) and Tucker decompositions yield higher-order principal components that have been used to understand tensor d...
155
click to vote
IMA
2005
Springer
16 years 6 days ago
2005
Springer
In this paper, a study of a paradigm for domain expansion of MACs is generalized. In particular, a tradeoff between the efficiency of a MAC and the tightness of its security reduc...
170
click to vote
RTA
2004
Springer
16 years 2 days ago
2004
Springer
Several authors devised type-based termination criteria for ML-like languages allowing non-structural recursive calls. We extend these works to general rewriting and dependent type...
179
click to vote
LOGCOM
2000
15 years 6 months ago
2000
The criterion for confluence using decreasing diagrams is a generalization of several well-known confluence criteria act rewriting, such as the strong confluence lemma. We give a ...