We use convex relaxation techniques to produce lower bounds on the optimal value of subset selection problems and generate good approximate solutions. We then explicitly bound the...
Francis Bach, Selin Damla Ahipasaoglu, Alexandre d...
We prove the strongest known bound for the risk of hypotheses selected from the ensemble generated by running a learning algorithm incrementally on the training data. Our result i...
This paper addresses the problem of photo time-stamp detection and recognition, which is to determine the time a photo was taken. Since the time-stamp is exposed together with the...
This paper presents Scan-SLAM, a new generalisation of simultaneous localisation and mapping (SLAM). SLAM implementations based on extended Kalman filter (EKF) data fusion have t...
This paper presents a fast and robust sprite generation algorithm for MPEG-4 video coding. Our contributions consist of two aspects. Firstly, a fast and robust Global Motion Estima...