Sciweavers

2695 search results - page 283 / 539
» Learning Graph Matching
Sort
View
196
Voted
PKDD
2010
Springer
164views Data Mining» more  PKDD 2010»
15 years 1 months ago
Efficient Planning in Large POMDPs through Policy Graph Based Factorized Approximations
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...
176
Voted
SDM
2012
SIAM
294views Data Mining» more  SDM 2012»
13 years 6 months ago
Kernelized Probabilistic Matrix Factorization: Exploiting Graphs and Side Information
We propose a new matrix completion algorithm— Kernelized Probabilistic Matrix Factorization (KPMF), which effectively incorporates external side information into the matrix fac...
Tinghui Zhou, Hanhuai Shan, Arindam Banerjee, Guil...
148
Voted
ISCSCT
2008
IEEE
15 years 10 months ago
Large Scale Scenes Reconstruction from Multiple Views
—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...
Limin Shi, Feng Zhang, Zhenhui Xu, Zhanyi Hu
118
Voted
IROS
2006
IEEE
108views Robotics» more  IROS 2006»
15 years 9 months ago
Sparse appearance based modeling for robot localization
— 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...
Olaf Booij, Zoran Zivkovic, Ben J. A. Kröse
171
Voted
PDCAT
2005
Springer
15 years 9 months ago
Approximating Spanning Trees with Inner Nodes Cost
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...