Results 1  10
of
242,709
An Efficient Solution to the FivePoint Relative Pose Problem
, 2004
"... An efficient algorithmic solution to the classical fivepoint relative pose problem is presented. The problem is to find the possible solutions for relative camera pose between two calibrated views given five corresponding points. The algorithm consists of computing the coefficients of a tenth degre ..."
Abstract

Cited by 484 (13 self)
 Add to MetaCart
in minimal as well as overdetermined cases. The performance is compared to that of the well known 8 and 7point methods and a 6point scheme. The algorithm is used in a robust hypothesizeandtest framework to estimate structure and motion in realtime with low delay. The realtime system uses solely visual
Loopy belief propagation for approximate inference: An empirical study. In:
 Proceedings of Uncertainty in AI,
, 1999
"... Abstract Recently, researchers have demonstrated that "loopy belief propagation" the use of Pearl's polytree algorithm in a Bayesian network with loops can perform well in the context of errorcorrecting codes. The most dramatic instance of this is the near Shannonlimit performanc ..."
Abstract

Cited by 676 (15 self)
 Add to MetaCart
. For each experimental run, we first gen erated random CPTs. We then sampled from the joint distribution defined by the network and clamped the observed nodes (all nodes in the bottom layer) to their sampled value. Given a structure and observations, we then ran three inference algorithms junction tree
Root Refinement for Real Polynomials
, 2011
"... We consider the problem of approximating all real roots of a squarefree polynomial f. Given isolating intervals, our algorithm refines each of them to a width of 2−L or less, that is, each of the roots is approximated to L bits after the binary point. Our method provides a certified answer for arb ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
We consider the problem of approximating all real roots of a squarefree polynomial f. Given isolating intervals, our algorithm refines each of them to a width of 2−L or less, that is, each of the roots is approximated to L bits after the binary point. Our method provides a certified answer
Computing real square roots of a real matrix
 Linear Algebra Appl
, 1987
"... Bjiirck and Hammarling [l] describe a fast, stable Schur method for computing a square root X of a matrix A (X2 = A). We present an extension of their method which enables real arithmetic to be used throughout when computing a real square root of a real matrix. For a nonsingular real matrix A condit ..."
Abstract

Cited by 55 (22 self)
 Add to MetaCart
conditions are given for the existence of a real square root, and for the existence of a real square root which is a polynomial in A; the number of square roots of the latter type is determined. The conditioning of matrix square roots is investigated, and an algorithm is given for the computation of a well
A Root Isolation Algorithm for Sparse Univariate Polynomials
"... We consider a univariate polynomial f with real coecients having a high degree N but a rather small number d+ 1 of monomials, with d << N. Such a sparse polynomial has a number of real root smaller or equal to d. Our target is to nd for each real root of f an interval isolating this root from ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
consider the augmented Fvirtual roots of f and introduce a genericity property which eases our study. We present a real root isolation method and an algorithm which has been implemented in Maple. We rely on an improved generalized BudanFourier count applied to both the input polynomial and its reciprocal
Polynomial RootFinding : Analysis and Computational Investigation of a Parallel Algorithm
 Proceedings of the 4th Annual Symposium on Parallel Algorithms and Architectures
, 1992
"... A practical version of a parallel algorithm that approximates the roots of a polynomial whose roots are all real is developed using the ideas of an existing NC algorithm. An new elementary proof of correctness is provided and the complexity of the algorithm is analyzed. A particular implementation o ..."
Abstract

Cited by 8 (0 self)
 Add to MetaCart
A practical version of a parallel algorithm that approximates the roots of a polynomial whose roots are all real is developed using the ideas of an existing NC algorithm. An new elementary proof of correctness is provided and the complexity of the algorithm is analyzed. A particular implementation
Results 1  10
of
242,709