3466 search results - page 75 / 694 » Fast computation of special resultants |
157
click to vote
ICCAD
2003
IEEE
16 years 3 months ago
2003
IEEE
This paper presents a generalized semi-analytic method for computing oscillator phase noise spectra, including the details very close to the oscillation frequency. The starting po...
191
Voted
WABI
2010
Springer
15 years 4 months ago
2010
Springer
The center string (or closest string) problem is a classical computer science problem with important applications in computational biology. Given k input strings and a distance thr...
148
Voted
ICCAD
2006
IEEE
16 years 3 months ago
2006
IEEE
Soft error tolerant design becomes more crucial due to exponential increase in the vulnerability of computer systems to soft errors. Accurate estimation of soft error rate (SER), ...
152
Voted
ISSAC
2009
Springer
16 years 21 days ago
2009
Springer
The computation of triangular decompositions involves two fundamental operations: polynomial GCDs modulo regular chains and regularity test modulo saturated ideals. We propose new...
162
click to vote
JCB
2008
15 years 6 months ago
2008
In this article, we propose a new method for computing rare maximal exact matches between multiple sequences. A rare match between k sequences S1; : : :; Sk is a string that occur...