Partially observable Markov decision processes (POMDPs) are widely used for planning under uncertainty. In many applications, the huge size of the POMDP state space makes straightf...
Joni Pajarinen, Jaakko Peltonen, Ari Hottinen, Mik...
We propose a new matrix completion algorithm— Kernelized Probabilistic Matrix Factorization (KPMF), which effectively incorporates external side information into the matrix fac...
—In this paper, we present a novel method to reconstruct the large scale scenes from multiple calibrated images. It first generates a quasi-dense 3D point cloud of the scene by m...
— In appearance based robot localization a new image is matched with every image in the database. In this paper we describe how to reduce the number of images in this database wi...
We consider the practical NP-complete problem of finding a minimum weight spanning tree with both edge weights and inner nodes weights. We present two polynomial time algorithms ...
Rudolf Fleischer, Qi Ge, Jian Li, Shijun Tian, Hai...