We study the rates of growth of the regret in online convex optimization. First, we show that a simple extension of the algorithm of Hazan et al eliminates the need for a priori k...
This work presents a neural model of self-localisation implemented on a simulated mobile robot with a realistic visual input. A population of modelled place cells with overlapping...
Denis Sheynikhovich, Ricardo Chavarriaga, Thomas S...
This paper presents two novel generic adaptive batching schemes for replicated servers. Both schemes are oblivious to the underlying communication protocols. Our novel schemes ada...
We present an algorithm for computing a robust adaptive polygonal approximation of an implicit curve in the plane. The approximation is adapted to the geometry of the curve because...
We present a novel scheme for the transmission of H.264/AVC video streams over lossy packet networks. The proposed scheme exploits the error resilient features of H.264/AVC codec ...
Nikolaos Thomos, Savvas Argyropoulos, Nikolaos V. ...