Sciweavers

1469 search results - page 21 / 294
» Approximate polynomial decomposition
Sort
View
FPL
2006
Springer
223views Hardware» more  FPL 2006»
15 years 1 months ago
From Equation to VHDL: Using Rewriting Logic for Automated Function Generation
This paper presents a novel tool flow combining rewriting logic with hardware synthesis. It enables the automated generation of synthesizable VHDL code from mathematical equations...
Carlos Morra, M. Sackmann, Sunil Shukla, Jürg...
CORR
2008
Springer
131views Education» more  CORR 2008»
14 years 9 months ago
Optimizing polynomials for floating-point implementation
The floating-point implementation of a function often reduces to a polynomial approximation on an interval. Remez algorithm provides the polynomial closest to the function, but th...
Florent de Dinechin, Christoph Quirin Lauter
UAI
2003
14 years 11 months ago
Approximate Decomposition: A Method for Bounding and Estimating Probabilistic and Deterministic Queries
In this paper, we introduce a method for approximating the solution to inference and optimization tasks in uncertain and deterministic reasoning. Such tasks are in general intract...
David Larkin
78
Voted
STOC
2005
ACM
111views Algorithms» more  STOC 2005»
15 years 10 months ago
Tensor decomposition and approximation schemes for constraint satisfaction problems
Wenceslas Fernandez de la Vega, Marek Karpinski, R...
SODA
2010
ACM
216views Algorithms» more  SODA 2010»
15 years 7 months ago
Decomposition, Approximation, and Coloring of Odd-Minor-Free Graphs
Erik D. Demaine, MohammadTaghi Hajiaghayi, Ken-ich...