Sciweavers

2103 search results - page 355 / 421
» Approximate Learning of Dynamic Models
Sort
View
164
Voted
JMLR
2012
13 years 5 months ago
Globally Optimizing Graph Partitioning Problems Using Message Passing
Graph partitioning algorithms play a central role in data analysis and machine learning. Most useful graph partitioning criteria correspond to optimizing a ratio between the cut a...
Elad Mezuman, Yair Weiss
136
Voted
CVPR
2012
IEEE
13 years 5 months ago
Discrete texture traces: Topological representation of geometric context
Modeling representations of image patches that are quasi-invariant to spatial deformations is an important problem in computer vision. In this paper, we propose a novel concept, t...
Jan Ernst, Maneesh Kumar Singh, Visvanathan Ramesh
ICRA
2006
IEEE
110views Robotics» more  ICRA 2006»
15 years 8 months ago
Speeding-up Rao-blackwellized SLAM
— Recently, Rao-Blackwellized particle filters have become a popular tool to solve the simultaneous localization and mapping problem. This technique applies a particle filter i...
Giorgio Grisetti, Gian Diego Tipaldi, Cyrill Stach...
133
Voted
ICDM
2009
IEEE
109views Data Mining» more  ICDM 2009»
15 years 9 months ago
Knowledge Discovery from Citation Networks
—Knowledge discovery from scientific articles has received increasing attentions recently since huge repositories are made available by the development of the Internet and digit...
Zhen Guo, Zhongfei Zhang, Shenghuo Zhu, Yun Chi, Y...
135
Voted
ATAL
2007
Springer
15 years 8 months ago
Q-value functions for decentralized POMDPs
Planning in single-agent models like MDPs and POMDPs can be carried out by resorting to Q-value functions: a (near-) optimal Q-value function is computed in a recursive manner by ...
Frans A. Oliehoek, Nikos A. Vlassis