Sciweavers

1380 search results - page 43 / 276
» A General Polynomial Sieve
Sort
View
DKE
2002
113views more  DKE 2002»
13 years 8 months ago
A general strategy for decomposing topological invariants of spatial databases and an application
Topological invariants of spatial databases (i.e., finite structures that capture the topological properties of the database) are receiving increasing attention since they can act...
Serafino Cicerone, Daniele Frigioni, Paolino Di Fe...
ICCAD
2004
IEEE
121views Hardware» more  ICCAD 2004»
14 years 5 months ago
Factoring and eliminating common subexpressions in polynomial expressions
Polynomial expressions are used to compute a wide variety of mathematical functions commonly found in signal processing and graphics applications, which provide good opportunities...
Anup Hosangadi, Farzan Fallah, Ryan Kastner
LICS
2009
IEEE
14 years 3 months ago
An Algebra for Kripke Polynomial Coalgebras
Several dynamical systems, such as deterministic automata and labelled transition systems, can be described as coalgebras of so-called Kripke polynomial functors, built up from co...
Marcello M. Bonsangue, Jan J. M. M. Rutten, Alexan...
COCO
2007
Springer
106views Algorithms» more  COCO 2007»
14 years 2 months ago
The Complexity of Polynomials and Their Coefficient Functions
We study the link between the complexity of a polynomial and that of its coefficient functions. Valiant’s theory is a good setting for this, and we start by generalizing one of V...
Guillaume Malod
SAC
2006
ACM
14 years 2 months ago
Provably faithful evaluation of polynomials
We provide sufficient conditions that formally guarantee that the floating-point computation of a polynomial evaluation is faithful. To this end, we develop a formalization of ï¬...
Sylvie Boldo, César Muñoz