10608 search results - page 328 / 2122 » Complexity of O'Hara's Algorithm |
172
Voted
GMP
2010
IEEE
15 years 27 days ago
2010
IEEE
Abstract. Riemann surfaces naturally appear in the analysis of complex functions that are branched over the complex plane. However, they usually possess a complicated topology and ...
102
Voted
IPPS
1996
IEEE
15 years 4 months ago
1996
IEEE
A new VLSI architecture for real-time pipeline FFT processor is proposed. A hardware oriented radix-22 algorithm is derived by integrating a twiddle factor decomposition technique ...
186
click to vote
ISSAC
2011
Springer
14 years 3 months ago
2011
Springer
There are several algorithms for factoring in Z[x] which have a proven polynomial complexity bound such as Sch¨onhage of 1984, Belabas/Kl¨uners/van Hoeij/Steel of 2004, and vanH...
108
Voted
WABI
2001
Springer
15 years 5 months ago
2001
Springer
We develop fast algorithms for computing the linking number of a simplicial complex within a filtration. We give experimental results in applying our work toward the detection of...
84
Voted
VRML
1997
ACM
15 years 4 months ago
1997
ACM
Level of detail generation is important for managing geometric complexity of three-dimensional objects and virtual worlds. However, most algorithms that compute levels of detail do...