903 search results - page 23 / 181 » On the reduction of a random basis |
COLT
2008
Springer
15 years 3 months ago
2008
Springer
This paper describes an efficient reduction of the learning problem of ranking to binary classification. The reduction guarantees an average pairwise misranking regret of at most t...
125
click to vote
PAMI
2006
15 years 1 months ago
2006
We provide evidence that non-linear dimensionality reduction, clustering and data set parameterization can be solved within one and the same framework. The main idea is to define ...
84
Voted
ICPR
2008
IEEE
15 years 8 months ago
2008
IEEE
We propose a recursive spatial-domain speckle reduction algorithm for synthetic aperture radar (SAR) imagery based on the unscented Kalman filter (UKF) with a discontinuity-adapt...
EUROCRYPT
1999
Springer
15 years 6 months ago
1999
Springer
We prove the first general and non-trivial lower bound for the number of times a 1-out-of-n Oblivious Transfer of strings of length should be invoked so as to obtain, by an inform...
132
click to vote
ICASSP
2011
IEEE
14 years 5 months ago
2011
IEEE
We consider the problem of classification of a pattern from multiple compressed observations that are collected in a sensor network. In particular, we exploit the properties of r...