31 search results - page 5 / 7 » Ranking with Kernels in Fourier space |
ECCV
2008
Springer
14 years 9 months ago
2008
Springer
We show that the complexity of the recently introduced medoid-shift algorithm in clustering N points is O(N2 ), with a small constant, if the underlying distance is Euclidean. This...
ICASSP
2009
IEEE
14 years 2 months ago
2009
IEEE
The algebraic theory of finite groups appears in signal processing problems involving the statistical analysis of ranked data and the construction of invariants for pattern recog...
CVPR
2007
IEEE
14 years 9 months ago
2007
IEEE
We propose a new multiple instance learning (MIL) algorithm to learn image categories. Unlike existing MIL algorithms, in which the individual instances in a bag are assumed to be...
COLT
2005
Springer
14 years 26 days ago
2005
Springer
We discuss a simple sparse linear problem that is hard to learn with any algorithm that uses a linear combination of the training instances as its weight vector. The hardness holds...
ICIAR
2005
Springer
14 years 25 days ago
2005
Springer
A method for color indexing is proposed that is based upon nonparametric statistical techniques. Nonparametrics compare the ordinal rankings of sample populations, and maintain the...