Sciweavers

2766 search results - page 191 / 554
» Algorithms for trigonometric polynomials
Sort
View
IWPEC
2004
Springer
15 years 10 months ago
The Minimum Weight Triangulation Problem with Few Inner Points
We propose to look at the computational complexity of 2-dimensional geometric optimization problems on a finite point set with respect to the number of inner points (that is, poi...
Michael Hoffmann, Yoshio Okamoto
GECCO
2008
Springer
172views Optimization» more  GECCO 2008»
15 years 5 months ago
Recursive least squares and quadratic prediction in continuous multistep problems
XCS with computed prediction, namely XCSF, has been recently extended in several ways. In particular, a novel prediction update algorithm based on recursive least squares and the ...
Daniele Loiacono, Pier Luca Lanzi
PAMI
2006
168views more  PAMI 2006»
15 years 4 months ago
Graphical Models and Point Pattern Matching
This paper describes a novel solution to the rigid point pattern matching problem in Euclidean spaces of any dimension. Although we assume rigid motion, jitter is allowed. We pres...
Tibério S. Caetano, Terry Caelli, Dale Schu...
CVPR
2003
IEEE
16 years 6 months ago
An Efficient Solution to the Five-Point Relative Pose Problem
An efficient algorithmic solution to the classical five-point relative pose problem is presented. The problem is to find the possible solutions for relative camera motion between ...
David Nistér
ADAEUROPE
2007
Springer
15 years 10 months ago
Static Detection of Livelocks in Ada Multitasking Programs
Abstract. In this paper we present algorithms to statically detect livelocks in Ada multitasking programs. Although the algorithms’ worst-case execution time is exponential, they...
Johann Blieberger, Bernd Burgstaller, Robert Mitte...