Sciweavers

793 search results - page 16 / 159
» Efficient computation of the characteristic polynomial
Sort
View
ECCV
2006
Springer
14 years 9 months ago
Direct Solutions for Computing Cylinders from Minimal Sets of 3D Points
Efficient direct solutions for the determination of a cylinder from points are presented. The solutions range from the well known direct solution of a quadric to the minimal soluti...
Christian Beder, Wolfgang Förstner
RECOMB
1997
Springer
13 years 11 months ago
A more efficient approximation scheme for tree alignment
We present a new polynomial time approximation scheme (PTAS) for tree alignment, which is an important variant of multiple sequence alignment. As in the existing PTASs in the liter...
Lusheng Wang, Tao Jiang, Dan Gusfield
CORR
2010
Springer
99views Education» more  CORR 2010»
13 years 7 months ago
On Functional Decomposition of Multivariate Polynomials with Differentiation and Homogenization
In this paper, we give a theoretical analysis for the algorithms to compute functional decomposition for multivariate polynomials based on differentiation and homogenization which ...
Shang-Wei Zhao, Ruyong Feng, Xiao-Shan Gao
CSL
2010
Springer
13 years 8 months ago
From Feasible Proofs to Feasible Computations
We shall discuss several situations in which it is possible to extract from a proof, be it a proof in a first-order theory or a propositional proof, some feasible computational inf...
Jan Krajícek
WSCG
2004
157views more  WSCG 2004»
13 years 9 months ago
Efficient Implementation of Higher Order Image Interpolation
This work presents a new method of fast cubic and higher order image interpolation. The evaluation of the piecewise n-th order polynomial kernels is accelerated by transforming th...
Roland Perko, Horst Bischof