Sciweavers

157 search results - page 22 / 32
» Compact representations of separable graphs
Sort
View
JETAI
1998
110views more  JETAI 1998»
13 years 7 months ago
Independency relationships and learning algorithms for singly connected networks
Graphical structures such as Bayesian networks or Markov networks are very useful tools for representing irrelevance or independency relationships, and they may be used to e cientl...
Luis M. de Campos
CVPR
2005
IEEE
14 years 9 months ago
On Modelling Nonlinear Shape-and-Texture Appearance Manifolds
Statistical shape-and-texture appearance models employ image metamorphosis to form a rich, compact representation of object appearance. They achieve their efficiency by decomposin...
Chris Mario Christoudias, Trevor Darrell
CVPR
2008
IEEE
14 years 9 months ago
Where am I: Place instance and category recognition using spatial PACT
We introduce spatial PACT (Principal component Analysis of Census Transform histograms), a new representation for recognizing instances and categories of places or scenes. Both pl...
Jianxin Wu, James M. Rehg
ICCV
2007
IEEE
14 years 9 months ago
Noise Robust Spectral Clustering
This paper aims to introduce the robustness against noise into the spectral clustering algorithm. First, we propose a warping model to map the data into a new space on the basis o...
Zhenguo Li, Jianzhuang Liu, Shifeng Chen, Xiaoou T...
IJRR
2010
162views more  IJRR 2010»
13 years 5 months ago
Planning under Uncertainty for Robotic Tasks with Mixed Observability
Partially observable Markov decision processes (POMDPs) provide a principled, general framework for robot motion planning in uncertain and dynamic environments. They have been app...
Sylvie C. W. Ong, Shao Wei Png, David Hsu, Wee Sun...