Sciweavers

1407 search results - page 66 / 282
» Join-Graph Propagation Algorithms
Sort
View
ICPR
2000
IEEE
14 years 10 months ago
Robust Dense Matching Using Local and Global Geometric Constraints
A new robust dense matching algorithm is introduced in this paper. The algorithm starts from matching the most textured points, then a match propagation algorithm is developed wit...
Maxime Lhuillier, Long Quan
ICASSP
2011
IEEE
13 years 16 days ago
Joint disparity and optical flow by correspondence growing
The scene flow in binocular stereo setup is estimated using a seed growing algorithm. A pair of calibrated and synchronized cameras observe a scene and output a sequence of image...
Jan Cech, Radu Horaud
UAI
2003
13 years 10 months ago
Systematic vs. Non-systematic Algorithms for Solving the MPE Task
The paper explores the power of two systematic Branch and Bound search algorithms that exploit partition-based heuristics, BBBT (a new algorithm for which the heuristic informatio...
Radu Marinescu 0002, Kalev Kask, Rina Dechter
PKDD
2009
Springer
117views Data Mining» more  PKDD 2009»
14 years 3 months ago
New Regularized Algorithms for Transductive Learning
Abstract. We propose a new graph-based label propagation algorithm for transductive learning. Each example is associated with a vertex in an undirected graph and a weighted edge be...
Partha Pratim Talukdar, Koby Crammer
ESANN
2008
13 years 10 months ago
Petri nets design based on neural networks
Petri net faulty models are useful for reliability analysis and fault diagnosis of discrete event systems. Such models are difficult to work out as long as they must be computed ac...
Edouard Leclercq, Souleiman Ould el Medhi, Dimitri...