Abstract. In a decision tree model, (n log2 n m i=1 ni log2 ni + n) is known to be a lower bound for sorting a multiset of size n containing m distinct elements, where the ith dist...
In this paper, we show that a better performance can be achieved by training a keypoint detector to only find those points that are suitable to the needs of the given task. We demo...
Christoph Strecha, Albrecht Lindner, Karim Ali, Pa...
In this paper, we show that the LVQ learning algorithm converges to locally asymptotic stable equilibria of an ordinary differential equation. We show that the learning algorithm ...
Abstract: We investigate the parametrization issue for discrete-time stable allpass multivariable systems by means of a Schur algorithm involving a Nudelman interpolation condition...
: We consider the problem of routing locality in peer-to-peer storage systems where peers store and exchange data among themselves. With the global information, peers will take the...