Sciweavers

2430 search results - page 27 / 486
» Computing Tutte Polynomials
Sort
View
ASAP
1995
IEEE
145views Hardware» more  ASAP 1995»
15 years 9 months ago
An array processor for inner product computations using a Fermat number ALU
This paper explores an architecture for parallel independent computations of inner products over the direct product ring . The structure is based on the polynomial mapping of the ...
Wenzhe Luo, Graham A. Jullien, Neil M. Wigley, Wil...
JSC
2007
106views more  JSC 2007»
15 years 5 months ago
Computing multihomogeneous resultants using straight-line programs
We present a new algorithm for the computation of resultants associated with multihomogeneous (and, in particular, homogeneous) polynomial equation systems using straight-line pro...
Gabriela Jeronimo, Juan Sabia
MOC
2010
15 years 19 days ago
Computation of conformal representations of compact Riemann surfaces
We find a system of two polynomial equations in two unknowns, whose solution allows us to give an explicit expression of the conformal representation of a simply connected three-sh...
Guillermo López Lagomasino, Domingo Pestana...
SAC
2006
ACM
15 years 11 months ago
Pseudozero set of interval polynomials
Interval polynomials are useful to describe perturbed polynomials. We present a graphical tool to describe how perturbations of the polynomial coefficients affect its zeros witho...
Stef Graillat, Philippe Langlois
SDMW
2004
Springer
15 years 11 months ago
Using Secret Sharing for Searching in Encrypted Data
When outsourcing data to an untrusted database server, the data should be encrypted. When using thin clients or low-bandwidth networks it is best to perform most of the work at the...
Richard Brinkman, Jeroen Doumen, Willem Jonker