Sciweavers

2430 search results - page 17 / 486
» Computing Tutte Polynomials
Sort
View
DM
2006
103views more  DM 2006»
13 years 7 months ago
Graph polynomials from principal pivoting
The recursive computation of the interlace polynomial introduced by Arratia, Bollob
Roland Glantz, Marcello Pelillo
WG
2005
Springer
14 years 1 months ago
Computation of Chromatic Polynomials Using Triangulations and Clique Trees
In this paper, we present a new algorithm for computing the chromatic polynomial of a general graph G. Our method is based on the addition of edges and contraction of non-edges of ...
Pascal Berthomé, Sylvain Lebresne, Kim Nguy...
ISSAC
2005
Springer
105views Mathematics» more  ISSAC 2005»
14 years 1 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
BILDMED
2008
124views Algorithms» more  BILDMED 2008»
13 years 9 months ago
Non-equispaced Fourier Transform Vs. Polynomial-Based Metal Artifact Reduction in Computed Tomography
We propose a method, which treats metal artifact reduction in CT by sinogram restoration as a problem of scattered data interpolation. Corrupted sinogram entries are discarded and ...
Bärbel Kratz, Tobias Knopp, Jan Müller 0...
ICRA
2008
IEEE
104views Robotics» more  ICRA 2008»
14 years 2 months ago
Towards locally computable polynomial navigation functions for convex obstacle workspaces
— In this paper we present a polynomial Navigation Function (NF) for a sphere world that can be constructed almost locally, with partial knowledge of the environment. The present...
Grigoris Lionis, Xanthi Papageorgiou, Kostas J. Ky...