Sciweavers

2766 search results - page 94 / 554
» Algorithms for trigonometric polynomials
Sort
View
97
Voted
COCO
2006
Springer
88views Algorithms» more  COCO 2006»
15 years 2 months ago
Polynomial Identity Testing for Depth 3 Circuits
We study the identity testing problem for depth 3 arithmetic circuits ( circuit). We give the first deterministic polynomial time identity test for circuits with bounded top fanin...
Neeraj Kayal, Nitin Saxena
ICCV
2011
IEEE
14 years 25 days ago
Optimizing Polynomial Solvers for Minimal Geometry Problems
In recent years polynomial solvers based on algebraic geometry techniques, and specifically the action matrix method, have become popular for solving minimal problems in computer...
Oleg Naroditsky, Kostas Daniilidis
ISSAC
2004
Springer
135views Mathematics» more  ISSAC 2004»
15 years 6 months ago
The truncated fourier transform and applications
In this paper, we present a truncated version of the classical Fast Fourier Transform. When applied to polynomial multiplication, this algorithm has the nice property of eliminati...
Joris van der Hoeven
CORR
2011
Springer
213views Education» more  CORR 2011»
14 years 4 months ago
Symbolic computation of weighted Moore-Penrose inverse using partitioning method
We propose a method and algorithm for computing the weighted MoorePenrose inverse of one-variable rational matrices. Also, we develop an algorithm for computing the weighted Moore...
Milan B. Tasic, Predrag S. Stanimirovic, Marko D. ...
FM
2009
Springer
104views Formal Methods» more  FM 2009»
15 years 7 months ago
A Smooth Combination of Linear and Herbrand Equalities for Polynomial Time Must-Alias Analysis
Abstract. We present a new domain for analyzing must-equalities between address expressions. The domain is a smooth combination of Herbrand and affine equalities which enables us t...
Helmut Seidl, Vesal Vojdani, Varmo Vene