We estimate the speed of texture change by measuring the spread of texture vectors in their feature space. This method allows us to robustly detect even very slow moving objects. B...
Longin Jan Latecki, Roland Miezianko, Dragoljub Po...
We introduce an efficient algorithm for the problem of online linear optimization in the bandit setting which achieves the optimal O ( T) regret. The setting is a natural general...
We further develop the idea that the PAC-Bayes prior can be informed by the data-generating distribution. We prove sharp bounds for an existing framework of Gibbs algorithms, and ...
In this paper, we review five heuristic strategies for handling context-sensitive features in supervised machine learning from examples. We discuss two methods for recovering lost...
We propose in this paper a new method to compute indicators based on models transformations. We use the concept of modeled trace and trace-based system to design an indicator. We u...