Sciweavers

1291 search results - page 11 / 259
» Computing the multiplicity structure in solving polynomial s...
Sort
View
ISSAC
2009
Springer
155views Mathematics» more  ISSAC 2009»
14 years 2 months ago
Parallel sparse polynomial multiplication using heaps
We present a high performance algorithm for multiplying sparse distributed polynomials using a multicore processor. Each core uses a heap of pointers to multiply parts of the poly...
Michael B. Monagan, Roman Pearce
GLVLSI
2008
IEEE
129views VLSI» more  GLVLSI 2008»
14 years 2 months ago
Variational capacitance modeling using orthogonal polynomial method
In this paper, we propose a novel statistical capacitance extraction method for interconnects considering process variations. The new method, called statCap, is based on the spect...
Jian Cui, Gengsheng Chen, Ruijing Shen, Sheldon X....
DNA
2006
Springer
129views Bioinformatics» more  DNA 2006»
13 years 11 months ago
P Systems with Active Membranes Characterize PSPACE
P system is a natural computing model inspired by behavior of living cells and their membranes. We show that (semi-)uniform families of P systems with active membranes can solve i...
Petr Sosík, Alfonso Rodríguez-Pat&oa...
RTA
1997
Springer
13 years 11 months ago
Solving Linear Diophantine Equations Using the Geometric Structure of the Solution Space
In the development of algorithms for finding the minimal solutions of systems of linear Diophantine equations, little use has been made (to our knowledge) of the results by Stanle...
Ana Paula Tomás, Miguel Filgueiras
CLUSTER
2001
IEEE
13 years 11 months ago
A Distributed Object Model for Solving Irregularly Structured Problems on Cluster
This paper presents a distributed object model MOIDE for solving irregularly structured problems on cluster. The primary appeal of MOIDE is its flexible system structure that is a...
Yudong Sun, Cho-Li Wang