Sciweavers

5170 search results - page 83 / 1034
» Consistency of the FastSLAM Algorithm
Sort
View
ACL
2012
13 years 3 months ago
Spectral Learning of Latent-Variable PCFGs
We introduce a spectral learning algorithm for latent-variable PCFGs (Petrov et al., 2006). Under a separability (singular value) condition, we prove that the method provides cons...
Shay B. Cohen, Karl Stratos, Michael Collins, Dean...
CP
2008
Springer
15 years 3 months ago
Flow-Based Propagators for the SEQUENCE and Related Global Constraints
We propose new filtering algorithms for the SEQUENCE constraint and some extensions of the SEQUENCE constraint based on network flows. We enforce domain consistency on the SEQUENCE...
Michael J. Maher, Nina Narodytska, Claude-Guy Quim...
ICCV
2009
IEEE
14 years 11 months ago
Non-iterative approach for fast and accurate vanishing point detection
We present an algorithm that quickly and accurately estimates vanishing points in images of man-made environments. Contrary to previously proposed solutions, ours is neither itera...
Jean-Philippe Tardif
ICPR
2008
IEEE
15 years 7 months ago
A clustering algorithm combine the FCM algorithm with supervised learning normal mixture model
In this paper we propose a new clustering algorithm which combines the FCM clustering algorithm with the supervised learning normal mixture model; we call the algorithm as the FCM...
Wei Wang, Chunheng Wang, Xia Cui, Ai Wang
ISSAC
2005
Springer
115views Mathematics» more  ISSAC 2005»
15 years 6 months ago
Algorithms for the non-monic case of the sparse modular GCD algorithm
Let G = (4y2 + 2z)x2 + (10y2 + 6z) be the greatest common divisor (gcd) of two polynomials A, B ∈   [x,y, z]. Because G is not monic in the main variable x, the sparse modular ...
Jennifer de Kleine, Michael B. Monagan, Allan D. W...