Sciweavers

2766 search results - page 30 / 554
» Algorithms for trigonometric polynomials
Sort
View
CVIU
2011
13 years 1 days ago
Polynomial algorithms for subisomorphism of nD open combinatorial maps
Combinatorial maps describe the subdivision of objects in cells, and incidence and adjacency relations between cells, and they are widely used to model 2D and 3D images. However, ...
Guillaume Damiand, Christine Solnon, Colin de la H...
ARITH
2007
IEEE
14 years 2 months ago
How to Ensure a Faithful Polynomial Evaluation with the Compensated Horner Algorithm
The compensated Horner algorithm improves the accuracy of polynomial evaluation in IEEE-754 floating point arithmetic: the computed result is as accurate as if it was computed wi...
Philippe Langlois, Nicolas Louvet
ESA
2009
Springer
190views Algorithms» more  ESA 2009»
14 years 11 days ago
Polynomial-Time Algorithm for the Leafage of Chordal Graphs
Every chordal graph G can be represented as the intersection graph of a collection of subtrees of a host tree, the so-called tree model of G. The leafage l(G) of a connected chorda...
Michel Habib, Juraj Stacho
CVPR
2010
IEEE
14 years 5 months ago
Relaxing the 3L algorithm for an accurate implicit polynomial fitting
This paper presents a novel method to increase the accuracy of linear fitting of implicit polynomials. The proposed method is based on the 3L algorithm philosophy. The novelty l...
Mohammad Rouhani and Angel D. Sappa
IJCAI
2001
13 years 10 months ago
R-MAX - A General Polynomial Time Algorithm for Near-Optimal Reinforcement Learning
R-max is a very simple model-based reinforcement learning algorithm which can attain near-optimal average reward in polynomial time. In R-max, the agent always maintains a complet...
Ronen I. Brafman, Moshe Tennenholtz