2018 search results - page 277 / 404 » Magnitude-preserving ranking algorithms |
194
click to vote
ECCV
2008
Springer
16 years 8 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...
192
click to vote
ICML
2006
IEEE
16 years 7 months ago
2006
IEEE
The structure of a Bayesian network (BN) encodes variable independence. Learning the structure of a BN, however, is typically of high computational complexity. In this paper, we e...
167
click to vote
CEC
2009
IEEE
16 years 28 days ago
2009
IEEE
— Differential Evolution (DE) is a novel evolutionary approach capable of handling non-differentiable, non-linear and multi-modal objective functions. DE has been consistently ra...
182
click to vote
COLT
2005
Springer
15 years 11 months 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...
185
click to vote
MIR
2004
ACM
15 years 11 months ago
2004
ACM
This paper proposes a new approach and algorithm for the similarity measure of video clips. The similarity is mainly based on two bipartite graph matching algorithms: maximum matc...