Sciweavers

2766 search results - page 68 / 554
» Algorithms for trigonometric polynomials
Sort
View
107
Voted
WG
2005
Springer
15 years 6 months ago
Computing the Tutte Polynomial on Graphs of Bounded Clique-Width
The Tutte polynomial is a notoriously hard graph invariant, and efficient algorithms for it are known only for a few special graph classes, like for those of bounded tree-width. Th...
Omer Giménez, Petr Hlinený, Marc Noy
107
Voted
ISSAC
2005
Springer
105views Mathematics» more  ISSAC 2005»
15 years 6 months ago
Computing the rank and a small nullspace basis of a polynomial matrix
We reduce the problem of computing the rank and a nullspace basis of a univariate polynomial matrix to polynomial matrix multiplication. For an input n×n matrix of degree d over ...
Arne Storjohann, Gilles Villard
82
Voted
ICRA
2007
IEEE
130views Robotics» more  ICRA 2007»
15 years 7 months ago
Mobile Robot Localization based on a Polynomial Approach
— This paper introduces a new analytical algorithm to perform the localization of a mobile robot using odometry and laser readings. Based on a polynomial approach, the proposed a...
C. Manes, Agostino Martinelli, F. Martinelli, P. P...
98
Voted
APLAS
2009
ACM
15 years 5 months ago
Branching Bisimilarity between Finite-State Systems and BPA or Normed BPP Is Polynomial-Time Decidable
In this paper we present polynomial time algorithms deciding branching bisimilarity between finite-state systems and several classes of infinite-state systems: BPA and normed BPP...
Hongfei Fu
CA
1996
IEEE
15 years 5 months ago
Efficient And Accurate Interference Detection For Polynomial Deformation
We present efficient and accurate algorithms for interference detection among objects undergoing polynomial deformation. The scope of our algorithms include physically-based model...
Merlin Hughes, Christopher DiMattia, Ming C. Lin, ...