15073 search results - page 319 / 3015 » Probabilistic algorithms for computing resultants |
128
click to vote
DLT
2008
15 years 6 months ago
2008
We show that for several classes of idempotent semirings the least fixed-point of a polynomial system of equations X = f(X) is equal to the least fixed-point of a linear system obt...
135
click to vote
SMA
2006
ACM
15 years 10 months ago
2006
ACM
— We present an efficient algorithm to compute the generalized penetration depth (PDg) between rigid models. Given two overlapping objects, our algorithm attempts to compute the...
141
click to vote
PVM
1999
Springer
15 years 9 months ago
1999
Springer
In this paper we study a parallel algorithm for computing the singular value decomposition (SVD) of a product of two matrices on message passing multiprocessors. This algorithm is ...
120
click to vote
JCB
2008
15 years 4 months ago
2008
Given a metabolic network in terms of its metabolites and reactions, our goal is to efficiently compute the minimal knock out sets of reactions required to block a given behaviour....
123
click to vote
IPPS
1998
IEEE
15 years 9 months ago
1998
IEEE
Vector prefix and reduction are collective communication primitives in which all processors must cooperate. We present two parallel algorithms, the direct algorithm and the split ...