Sciweavers

2219 search results - page 350 / 444
» Dynamic Programming and Graph Algorithms in Computer Vision
Sort
View
122
Voted
ICRA
2002
IEEE
92views Robotics» more  ICRA 2002»
15 years 7 months ago
Resolution Complete Rapidly-Exploring Random Trees
Trajectory design for high-dimensional systems with nonconvex constraints is a challenging problem considered in this paper. Classical dynamic programming is often employed, but c...
Peng Cheng, Steven M. LaValle
110
Voted
UAI
2004
15 years 3 months ago
PAC-learning Bounded Tree-width Graphical Models
We show that the class of strongly connected graphical models with treewidth at most k can be properly efficiently PAC-learnt with respect to the Kullback-Leibler Divergence. Prev...
Mukund Narasimhan, Jeff A. Bilmes
128
Voted
ICASSP
2011
IEEE
14 years 6 months ago
Sparse graphical modeling of piecewise-stationary time series
Graphical models are useful for capturing interdependencies of statistical variables in various fields. Estimating parameters describing sparse graphical models of stationary mul...
Daniele Angelosante, Georgios B. Giannakis
198
Voted
ICASSP
2011
IEEE
14 years 6 months ago
Contour-based hidden Markov model to segment 2D ultrasound images
The segmentation of ultrasound images is challenging due to the difficulty of appropriate modeling of their appearance variations including speckle as well as signal dropout. We ...
Xiaoning Qian, Byung-Jun Yoon
99
Voted
IDA
2007
Springer
15 years 8 months ago
Learning to Align: A Statistical Approach
We present a new machine learning approach to the inverse parametric sequence alignment problem: given as training examples a set of correct pairwise global alignments, find the p...
Elisa Ricci, Tijl De Bie, Nello Cristianini