Find link

language:

jump to random article

Find link is a tool written by Edward Betts.

Longer titles found: Fast Algorithms for Multidimensional Signals (view)

Fast algorithms is a redirect to time complexity

searching for Fast algorithms 149 found (163 total)

alternate case: fast algorithms

Ramakrishnan Srikant (215 words) [view diff] exact match in snippet view article find links to article

Google. His primary field of research is Data Mining. His 1994 paper, "Fast algorithms for mining association rules", co-authored with Rakesh Agrawal has
Discrete Hartley transform (4,188 words) [view diff] exact match in snippet view article find links to article
(HT), introduced by Ralph V. L. Hartley in 1942. Because there are fast algorithms for the DHT analogous to the fast Fourier transform (FFT), the DHT
Arithmetic–geometric mean (3,029 words) [view diff] exact match in snippet view article find links to article
sequence of geometric means. The arithmetic–geometric mean is used in fast algorithms for exponential, trigonometric functions, and other special functions
Discrete cosine transform (11,964 words) [view diff] exact match in snippet view article find links to article
extend the concept of DCT to multidimensional signals. A variety of fast algorithms have been developed to reduce the computational complexity of implementing
Pseudo-spectral method (2,505 words) [view diff] exact match in snippet view article find links to article
operators, and can considerably speed up the calculation when using fast algorithms such as the fast Fourier transform. Take the initial-value problem
Magma (computer algebra system) (580 words) [view diff] exact match in snippet view article
groups are also included. Number theory Magma contains asymptotically fast algorithms for all fundamental integer and polynomial operations, such as the
Discrete Fourier transform over a ring (3,992 words) [view diff] exact match in snippet view article find links to article
theory. Such transform can be carried out efficiently with proper fast algorithms, for example, cyclotomic fast Fourier transform. Suppose F = G F (
Theil–Sen estimator (2,821 words) [view diff] exact match in snippet view article find links to article
nonparametric technique for estimating a linear trend". There are fast algorithms for efficiently computing the parameters. As defined by Theil (1950)
Daala (1,369 words) [view diff] case mismatch in snippet view article find links to article
1992). "Extended Lapped Transforms: Properties, Applications, and Fast Algorithms" (PDF). IEEE Transactions on Signal Processing. 40 (11): 2703–2714
Richard Blahut (606 words) [view diff] case mismatch in snippet view article find links to article
Telecommunications, (Cambridge University Press, 2010) ISBN 978-0521780148 Fast Algorithms for Signal Processing, (Cambridge University Press, 2010) ISBN 978-0521190497
Lapped transform (291 words) [view diff] case mismatch in snippet view article find links to article
1992). "Extended Lapped Transforms: Properties, Applications, and Fast Algorithms" (PDF). IEEE Transactions on Signal Processing. 40 (11): 2703–2714
Cartesian tree (4,294 words) [view diff] exact match in snippet view article find links to article
string that has a Cartesian tree of the same form as a given pattern. Fast algorithms for variations of the problem with a single pattern or multiple patterns
Siren (codec) (1,128 words) [view diff] case mismatch in snippet view article
(2017). Cosine-/Sine-Modulated Filter Banks: General Properties, Fast Algorithms and Integer Approximations. Springer. p. 478. ISBN 9783319610801. "Polycom
Cauchy matrix (903 words) [view diff] case mismatch in snippet view article find links to article
TiIo; Heinig, Georg; Rost, Karla (1993). "An Inversion Formula and Fast Algorithms for Cauchy-Vandermonde Matrices" (PDF). Linear Algebra and Its Applications
Eli Turkel (453 words) [view diff] exact match in snippet view article find links to article
scheme to solve the Euler equations. Another main contribution includes fast algorithms for the Navier-Stokes equations based on preconditioning techniques
Victor Pan (759 words) [view diff] exact match in snippet view article find links to article
theme of his research, computations with polynomials. He developed fast algorithms for the numerical computation of polynomial roots,[UP] and, with Bernard
G.719 (522 words) [view diff] case mismatch in snippet view article find links to article
(2017). Cosine-/Sine-Modulated Filter Banks: General Properties, Fast Algorithms and Integer Approximations. Springer. pp. 31, 478. ISBN 9783319610801
Fast Fourier transform (7,809 words) [view diff] exact match in snippet view article find links to article
any FFT algorithm can easily be adapted for it. The development of fast algorithms for DFT was prefigured in Carl Friedrich Gauss's unpublished 1805 work
Regular graph (1,017 words) [view diff] exact match in snippet view article find links to article
+ 1 {\displaystyle n=k+1} , then this circulant graph is complete. Fast algorithms exist to generate, up to isomorphism, all regular graphs with a given
Enhanced Variable Rate Codec B (467 words) [view diff] case mismatch in snippet view article find links to article
(2017). Cosine-/Sine-Modulated Filter Banks: General Properties, Fast Algorithms and Integer Approximations. Springer. pp. 31, 478. ISBN 9783319610801
Binary splitting (494 words) [view diff] case mismatch in snippet view article find links to article
Transm. 27, No.4, 339-360 (1991); translation from Probl. Peredachi Inf. 27, No.4, 76–99 (1991). Ekatherina Karatsuba. Fast Algorithms and the FEE method
Fermat primality test (1,123 words) [view diff] exact match in snippet view article find links to article
and all odd n respectively, hence testing them adds no value. Using fast algorithms for modular exponentiation and multiprecision multiplication, the running
Apriori algorithm (1,316 words) [view diff] exact match in snippet view article find links to article
purely bottom-up approach. Rakesh Agrawal and Ramakrishnan Srikant.Fast algorithms for mining association rules. Proceedings of the 20th International
Iterated function system (1,461 words) [view diff] exact match in snippet view article find links to article
kinds of self-similar structure shown by simple IFS fractals. Very fast algorithms exist to generate an image from a set of IFS or PIFS parameters. It
Hankel matrix (1,250 words) [view diff] exact match in snippet view article find links to article
org/10.1371/journal.pone.0174573 Brent R.P. (1999), "Stability of fast algorithms for structured linear systems", Fast Reliable Algorithms for Matrices
Olga Evdokimov (1,210 words) [view diff] case mismatch in snippet view article find links to article
Nuclear Research, Dubna, Russia. Her thesis was titled "Alignment and Fast Algorithms of Data Treatment for 4π-geometry Detectors." Evdokimov worked first
Nasir Ahmed (engineer) (1,546 words) [view diff] case mismatch in snippet view article
November 2006). Discrete Cosine and Sine Transforms: General Properties, Fast Algorithms and Integer Approximations. Academic Press. ISBN 978-0123736246. LCCN 2006931102
Fast Library for Number Theory (157 words) [view diff] case mismatch in snippet view article find links to article
the speed limitations of the PARI and NTL libraries. Asymptotically Fast Algorithms Implementations Fast as or Faster than Alternatives Written in Pure
Graph isomorphism (1,637 words) [view diff] exact match in snippet view article find links to article
NP-complete. The main areas of research for the problem are design of fast algorithms and theoretical investigations of its computational complexity, both
Odlyzko–Schönhage algorithm (287 words) [view diff] exact match in snippet view article find links to article
discusses the results in detail. Odlyzko, A. M.; Schönhage, A. (1988), "Fast algorithms for multiple evaluations of the Riemann zeta function", Trans. Amer
Closest pair of points problem (1,215 words) [view diff] exact match in snippet view article find links to article
1016/0020-0190(79)90085-1. hdl:1813/7460. MR 0515507. Clarkson, Kenneth L. (1983). "Fast algorithms for the all nearest neighbors problem". 24th Annual Symposium on Foundations
Solovay–Strassen primality test (1,518 words) [view diff] exact match in snippet view article find links to article
\equiv x{\pmod {n}}} then return composite return probably prime Using fast algorithms for modular exponentiation, the running time of this algorithm is O(k·log3
Arnold Schönhage (298 words) [view diff] case mismatch in snippet view article find links to article
ISSN 0001-0782. S2CID 209450552. Odlyzko, A. M.; Schönhage, A. (1988). "Fast Algorithms for Multiple Evaluations of the Riemann Zeta Function". Transactions
Topological index (1,229 words) [view diff] exact match in snippet view article find links to article
molecular connectivity index, Balaban's J index may be calculated by fast algorithms, in contrast to Hosoya index and its modifications for which non-exponential
David C. Munson (347 words) [view diff] exact match in snippet view article find links to article
systems. He is the co-founder of InstaRecon, which commercializes fast algorithms for image formation in computer tomography. He commented on the use
Least common multiple (2,555 words) [view diff] exact match in snippet view article find links to article
{21}{\gcd(21,6)}}=6\times {\frac {21}{3}}=6\times 7=42.} There are fast algorithms, such as the Euclidean algorithm for computing the gcd that do not
Olof B. Widlund (200 words) [view diff] case mismatch in snippet view article find links to article
at the Mathematics Genealogy Project Home page at Courant institute Fast Algorithms for Scientific Computing A Symposium in Honor of Olof B. Widlund on
Toeplitz matrix (2,060 words) [view diff] exact match in snippet view article find links to article
Birkhäuser, ISBN 978-3-0348-8395-5 Brent, R. P. (1999), "Stability of fast algorithms for structured linear systems", in Kailath, T.; Sayed, A. H. (eds.)
Game Description Language (1,612 words) [view diff] exact match in snippet view article find links to article
S2CID 121904640. Koller, Daphne; Megiddo, Nimrod; von Stengel, Bernhard (1994). "Fast algorithms for finding randomized strategies in game trees". Proceedings of the
Discrete sine transform (2,049 words) [view diff] case mismatch in snippet view article find links to article
(2010). Discrete Cosine and Sine Transforms: General Properties, Fast Algorithms and Integer Approximations. Elsevier. pp. 35–6. ISBN 9780080464640
Supersampling (1,026 words) [view diff] exact match in snippet view article find links to article
once limited its applications for real-time rendering. However, many fast algorithms now exist to generate Poisson disk noise, even those with variable
Digital radio (3,973 words) [view diff] case mismatch in snippet view article find links to article
(2017). Cosine-/Sine-Modulated Filter Banks: General Properties, Fast Algorithms and Integer Approximations. Springer. p. 478. ISBN 978-3-319-61080-1
Clustering high-dimensional data (2,284 words) [view diff] exact match in snippet view article find links to article
C. C.; Wolf, J. L.; Yu, P. S.; Procopiuc, C.; Park, J. S. (1999). "Fast algorithms for projected clustering". ACM SIGMOD Record. 28 (2): 61. CiteSeerX 10
Tridiagonal matrix (2,707 words) [view diff] exact match in snippet view article find links to article
operations for a matrix of size n × n {\displaystyle n\times n} , although fast algorithms exist which (without parallel computation) require only O ( n log ⁡
Packing problems (2,676 words) [view diff] exact match in snippet view article find links to article
the web server. The problem is NP-complete in general, but there are fast algorithms for solving small instances. In tiling or tessellation problems, there
Elastic net regularization (1,453 words) [view diff] exact match in snippet view article find links to article
implemented as an R source package and as a MATLAB toolbox. This includes fast algorithms for estimation of generalized linear models with ℓ1 (the lasso), ℓ2
Dan Gusfield (1,622 words) [view diff] exact match in snippet view article find links to article
multi-state perfect phylogeny problem using chordal graph theory, and fast algorithms for RNA folding. Since 2014 he has focused on the application and development
Beatrice Meini (235 words) [view diff] case mismatch in snippet view article find links to article
in 1993, and completed her Ph.D. there in 1998. Her dissertation, Fast Algorithms For The Numerical Solution of Structured Markov Chains, was supervised
William O. Baker Award for Initiatives in Research (1,171 words) [view diff] exact match in snippet view article find links to article
Mark Tygert [Wikidata] (2010, numerical methods) For development of fast algorithms in mathematical physics, operator compression, and linear algebra,
Rotating calipers (1,296 words) [view diff] exact match in snippet view article find links to article
McGill University. Binay K. Bhattacharya and Godfried T. Toussaint, "Fast algorithms for computing the diameter of a finite planar set," The Visual Computer
Rectangle packing (949 words) [view diff] exact match in snippet view article find links to article
the web server. The problem is NP-complete in general, but there are fast algorithms for solving small instances. Guillotine cutting is a variant of rectangle
MUMmer (819 words) [view diff] exact match in snippet view article find links to article
Delcher, A. L.; Phillippy, A.; Carlton, J.; Salzberg, S. L. (2002). "Fast algorithms for large-scale genome alignment and comparison". Nucleic Acids Research
Gabriele Steidl (283 words) [view diff] exact match in snippet view article find links to article
Algorithmen für verallgemeinerte diskrete Fouriertransformationen, concerned fast algorithms for the discrete Fourier transform and was supervised by Manfred Tasche
Range searching (1,415 words) [view diff] exact match in snippet view article find links to article
Joseph; Mortensen, Christian; Shi, Qingmin (2005). "Space-efficient and fast algorithms for multidimensional dominance reporting and counting". International
Quadratic programming (1,931 words) [view diff] exact match in snippet view article find links to article
ISSN 1436-4646. S2CID 35753865. Kapoor, S; Vaidya, P M (1986-11-01). "Fast algorithms for convex quadratic programming and multicommodity flows". Proceedings
Tree rearrangement (851 words) [view diff] exact match in snippet view article find links to article
ISBN 9780878931774. Takahashi, Kei; Nei, Masatoshi (August 2000). "Efficiencies of fast algorithms of phylogenetic inference under the criteria of maximum parsimony,
Arbitrary-precision arithmetic (2,791 words) [view diff] case mismatch in snippet view article find links to article
(2005). Prime Numbers. Springer-Verlag. ISBN 9780387252827., Chapter 9: Fast Algorithms for Large-Integer Arithmetic Chapter 9.3 of The Art of Assembly by
Tag cloud (2,494 words) [view diff] exact match in snippet view article find links to article
Marszałkowski, J., Mokwa, D., Drozdowski, M., Rusiecki, L., Narożny, H. Fast algorithms for online construction of web tag clouds, Engineering Applications
Integer partition (3,403 words) [view diff] case mismatch in snippet view article find links to article
in the FindStat database Integer::Partition Perl module from CPAN Fast Algorithms For Generating Integer Partitions Generating All Partitions: A Comparison
NP-completeness (3,618 words) [view diff] exact match in snippet view article find links to article
algorithms are usually possible. Parameterization: Often there are fast algorithms if certain parameters of the input are fixed. Heuristic: An algorithm
Divide-and-conquer algorithm (2,894 words) [view diff] case mismatch in snippet view article find links to article
produces approximately correct solutions Blahut, Richard (14 May 2014). Fast Algorithms for Signal Processing. Cambridge University Press. pp. 139–143.
K. R. Rao (1,258 words) [view diff] case mismatch in snippet view article find links to article
November 2006). Discrete Cosine and Sine Transforms: General Properties, Fast Algorithms and Integer Approximations. Academic Press. ISBN 978-0123736246. LCCN 2006931102
Mathematical constant (3,561 words) [view diff] exact match in snippet view article find links to article
of 2, have been computed to more than one hundred billion digits. Fast algorithms have been developed, some of which — as for Apéry's constant — are
Entropy estimation (1,415 words) [view diff] exact match in snippet view article find links to article
other methods in case of large alphabet sizes. Dinh-Tuan Pham (2004) Fast algorithms for mutual information based independent component analysis. In Signal
Heavy-light decomposition (1,017 words) [view diff] exact match in snippet view article find links to article
1016/0022-0000(83)90006-5, MR 0710253 Harel, Dov; Tarjan, Robert E. (1984), "Fast algorithms for finding nearest common ancestors", SIAM Journal on Computing, 13
Gregory Beylkin (360 words) [view diff] exact match in snippet view article find links to article
Gregory Beylkin's research is focused on analysis and development of fast algorithms for solving integral and differential equations. Applications include
Planar graph (4,589 words) [view diff] exact match in snippet view article find links to article
quickly decide whether a given graph is planar. However, there exist fast algorithms for this problem: for a graph with n vertices, it is possible to determine
Philip S. Yu (522 words) [view diff] exact match in snippet view article find links to article
IEEE Transactions on 8.6 (1996): 866–883. Aggarwal, Charu C., et al. "Fast algorithms for projected clustering." ACM SIGMOD Record. Vol. 28. No. 2. ACM,
Multi-key quicksort (700 words) [view diff] exact match in snippet view article find links to article
doi:10.1093/comjnl/5.1.10. Bentley, Jon; Sedgewick, Robert (1997). Fast algorithms for sorting and searching strings (PDF). Proc. Annual ACM-SIAM Symp
Holonomic function (1,977 words) [view diff] exact match in snippet view article find links to article
special function and combinatorial identities. Moreover, there exist fast algorithms for evaluating holonomic functions to arbitrary precision at any point
Independent set (graph theory) (3,564 words) [view diff] exact match in snippet view article
Vangelis Th.; van Rooij, Johan M. M. (2010), "A bottom-up method and fast algorithms for MAX INDEPENDENT SET", Algorithm Theory - SWAT 2010, Lecture Notes
Z-buffering (2,450 words) [view diff] exact match in snippet view article find links to article
was first described in 1974 by Wolfgang Straßer in his PhD thesis on fast algorithms for rendering occluded objects. A similar solution to determining overlapping
Rakesh Agrawal (computer scientist) (401 words) [view diff] exact match in snippet view article
as of February 2007 in CiteSeer). Wikipedia lists one of his papers Fast algorithms for mining association rules co-authored with Ramakrishnan Srikant
Geometric spanner (1,180 words) [view diff] exact match in snippet view article find links to article
spanner algorithms exist which excel in different quality measures. Fast algorithms include the WSPD spanner and the Theta graph which both construct spanners
Expression quantitative trait loci (1,533 words) [view diff] exact match in snippet view article find links to article
GeneNetwork hosts many large eQTL mapping data sets and provide access to fast algorithms to map single loci and epistatic interactions. As is true in all QTL
Martin Vetterli (1,130 words) [view diff] exact match in snippet view article find links to article
self-organized communications systems and sensor networks, as well as fast algorithms. Signal processing Communication networks Audio processing Inverse
Stable matching problem (2,544 words) [view diff] exact match in snippet view article find links to article
1287/inte.33.3.1.16013. ISSN 0092-2102. Gusfield, Dan (1987). "Three fast algorithms for four problems in stable marriage". SIAM Journal on Computing. 16
ELKI (2,106 words) [view diff] exact match in snippet view article find links to article
included algorithms: Cluster analysis: K-means clustering (including fast algorithms such as Elkan, Hamerly, Annulus, and Exponion k-Means, and robust variants
Potts model (3,645 words) [view diff] exact match in snippet view article find links to article
controls the tradeoff between regularity and data fidelity. There are fast algorithms for the exact minimization of the L1 and the L2-Potts functional. In
Carl Størmer (2,114 words) [view diff] exact match in snippet view article find links to article
be additional solutions of this type. These representations led to fast algorithms for computing numerical approximations of π. In particular, a four-term
Graph edit distance (1,533 words) [view diff] exact match in snippet view article find links to article
original URL status unknown (link) Shasha, D; Zhang, K (1989). "Simple fast algorithms for the editing distance between trees and related problems". SIAM
Anil K. Jain (electrical engineer, born 1946) (565 words) [view diff] exact match in snippet view article
interests ranged from "digital and image processing, computer vision, fast algorithms, real time digital systems architecture to stochastic processes and
Frank Natterer (1,141 words) [view diff] exact match in snippet view article find links to article
minimal number of measurements) in tomography Fourier reconstruction Fast algorithms in ultrasonic tomography. In this field, he successfully regularized
Howell normal form (885 words) [view diff] case mismatch in snippet view article find links to article
Wikidata Q110879587. Arne Storjohann; Thom Mulders (24 August 1998). "Fast Algorithms for Linear Algebra Modulo N". Lecture Notes in Computer Science: 139–150
Scott A. Mitchell (431 words) [view diff] exact match in snippet view article find links to article
duality) and surface reconstruction. Batagelj; Zaversnik (2011). "Fast algorithms for determining (generalized) core groups in social networks}". Advances
Reconfiguration (1,182 words) [view diff] exact match in snippet view article find links to article
mathematically using the theory of permutation groups, leading to fast algorithms for determining whether states are connected; however, finding the
Nearest neighbor search (3,341 words) [view diff] exact match in snippet view article find links to article
on 2016-03-03. Retrieved 2009-05-29. Clarkson, Kenneth L. (1983), "Fast algorithms for the all nearest neighbors problem", 24th IEEE Symp. Foundations
Fourier transform on finite groups (2,052 words) [view diff] exact match in snippet view article find links to article
Similarly, the Fourier transform on arbitrary groups can be used to give fast algorithms for matrices with other symmetries (Åhlander & Munthe-Kaas 2005). These
Factorial (8,433 words) [view diff] exact match in snippet view article find links to article
also "34.1.5: Performance", pp. 655–656. Schönhage, Arnold (1994). Fast algorithms: a multitape Turing machine implementation. B.I. Wissenschaftsverlag
Number theory (9,977 words) [view diff] exact match in snippet view article find links to article
split it into prime factors; doing so rapidly is another matter. Fast algorithms for testing primality are now known, but, in spite of much work (both
Computational social choice (1,538 words) [view diff] exact match in snippet view article find links to article
calculate the winner of an election. Therefore, it is important to design fast algorithms that can evaluate a voting rule when given ballots as input. As is
Step detection (1,943 words) [view diff] exact match in snippet view article find links to article
p = 2 {\displaystyle p=2} and p = 1 {\displaystyle p=1} there are fast algorithms which give an exact solution of the Potts problem in O ( N 2 ) {\displaystyle
Jacket matrix (1,256 words) [view diff] case mismatch in snippet view article find links to article
Elliptic Curves, and Parameterized Jacket Matrices Jacket Matrix and Its Fast Algorithms for Cooperative Wireless Signal Processing Jacket Matrices: Constructions
80 Million Tiny Images (601 words) [view diff] case mismatch in snippet view article find links to article
S2CID 7487588. 80 Million Tiny Images, IPAM Workshop on Numerical Tools and Fast Algorithms for Massive Data Mining, Search Engines and Applications October 23rd
Invertible matrix (7,170 words) [view diff] exact match in snippet view article find links to article
like LU decomposition are much faster than inversion, and various fast algorithms for special classes of linear systems have also been developed. Although
Tracy–Widom distribution (5,042 words) [view diff] exact match in snippet view article find links to article
p-values was also given in this work. Bornemann (2010) gave accurate and fast algorithms for the numerical evaluation of F β {\displaystyle F_{\beta }} and
Convolution (8,808 words) [view diff] exact match in snippet view article find links to article
for N outputs. That can be significantly reduced with any of several fast algorithms. Digital signal processing and other applications typically use fast
Parent–teacher conference (2,731 words) [view diff] exact match in snippet view article find links to article
involve constraint satisfaction and combinatorial optimization (so no fast algorithms are known for solving it). This can be seen as follows. We can check
Partial fraction decomposition (7,043 words) [view diff] case mismatch in snippet view article find links to article
1139–1140. doi:10.1109/PROC.1973.9216. Kung, H. T.; Tong, D. M. (1977). "Fast Algorithms for Partial Fraction Decomposition". SIAM Journal on Computing. 6 (3):
Comparison of audio coding formats (1,418 words) [view diff] case mismatch in snippet view article find links to article
(2017). Cosine-/Sine-Modulated Filter Banks: General Properties, Fast Algorithms and Integer Approximations. Springer. pp. 31, 478. ISBN 9783319610801
Ensemble learning (6,692 words) [view diff] exact match in snippet view article find links to article
have been improved by increasing resource use for a single method. Fast algorithms such as decision trees are commonly used in ensemble methods (e.g.
Bayesian operational modal analysis (1,100 words) [view diff] exact match in snippet view article find links to article
of ambient vibration data. Based on the formulation for FFT data, fast algorithms have been developed for computing the posterior statistics of modal
Lowest common ancestor (2,990 words) [view diff] exact match in snippet view article find links to article
ISBN 978-0897911337, S2CID 17752833. Harel, Dov; Tarjan, Robert E. (1984), "Fast algorithms for finding nearest common ancestors", SIAM Journal on Computing, 13
Mersenne prime (6,740 words) [view diff] exact match in snippet view article find links to article
verified only about three centuries after Mersenne published his list. Fast algorithms for finding Mersenne primes are available, and as of October 2024[update]
Georg Glaeser (638 words) [view diff] exact match in snippet view article find links to article
Amiga 3D-Sprinter. Pearson Education, 1993. Glaeser, Georg (1994). Fast algorithms for 3D-graphics. New York: Springer-Verlag. ISBN 0-387-94288-2. OCLC 30034010
Game theory (15,393 words) [view diff] exact match in snippet view article find links to article
S2CID 121904640. Koller, Daphne; Megiddo, Nimrod; von Stengel, Bernhard (1994). "Fast algorithms for finding randomized strategies in game trees". Proceedings of the
Widest path problem (3,017 words) [view diff] exact match in snippet view article find links to article
2009 Board Elections, August 2009. Duan, Ran; Pettie, Seth (2009), "Fast algorithms for (max, min)-matrix multiplication and bottleneck shortest paths"
Ravindra K. Ahuja (1,570 words) [view diff] case mismatch in snippet view article find links to article
 1232–1240. ISBN 978-1584887805. Vaidyanathan, B.; Ahuja, R. (2010). "Fast Algorithms for Specially Structured Minimum Cost Flow Problems with Applications"
Advanced Video Coding (9,794 words) [view diff] case mismatch in snippet view article find links to article
(2010). Discrete Cosine and Sine Transforms: General Properties, Fast Algorithms and Integer Approximations. Elsevier. pp. ix, xiii, 1, 141–304. ISBN 9780080464640
Formal concept analysis (5,372 words) [view diff] exact match in snippet view article find links to article
of particles and waves in physics. There are a number of simple and fast algorithms for generating formal concepts and for constructing and navigating
Freeman Dyson (8,577 words) [view diff] case mismatch in snippet view article find links to article
Springer. ISBN 978-0-387-94655-9. Odlyzko, A. M.; Schonhage, A. (1988). "Fast Algorithms for Multiple Evaluations of the Riemann Zeta Function". Transactions
Levinson recursion (2,717 words) [view diff] exact match in snippet view article find links to article
1137/S0895479891221563. S2CID 367586. Brent R.P. (1999), "Stability of fast algorithms for structured linear systems", Fast Reliable Algorithms for Matrices
Riemann zeta function (10,430 words) [view diff] exact match in snippet view article find links to article
Retrieved 27 July 2025. Odlyzko, A. M.; Schönhage, A. (1988). "Fast algorithms for multiple evaluations of the Riemann zeta function". Trans. Amer
Modular multiplicative inverse (3,652 words) [view diff] exact match in snippet view article find links to article
Euclid's Algorithm Integer multiplicative inverse via Newton's method provides fast algorithms to compute multiplicative inverses modulo powers of 2.
Latent semantic analysis (7,629 words) [view diff] exact match in snippet view article find links to article
algorithm has been developed. MATLAB and Python implementations of these fast algorithms are available. Unlike Gorrell and Webb's (2005) stochastic approximation
Bruun's FFT algorithm (2,211 words) [view diff] exact match in snippet view article find links to article
_{N}^{k})} where mod denotes the polynomial remainder operation. The key to fast algorithms like Bruun's or Cooley–Tukey comes from the fact that one can perform
Gamma function (13,545 words) [view diff] case mismatch in snippet view article find links to article
Russ. Math. Surv. Vol.46, No.2, pp. 246–247 (1991). E.A. Karatsuba "Fast Algorithms and the FEE Method". Borwein, J. M.; Zucker, I. J. (1992). "Fast evaluation
Anatol Slissenko (1,890 words) [view diff] exact match in snippet view article find links to article
multiplication, that without this bound on the length can give unrealistically fast algorithms. Besides that LRAM has a very dense time complexity hierarchy. During
Association rule learning (6,710 words) [view diff] exact match in snippet view article find links to article
ISBN 978-0-7695-1001-9. S2CID 1080975. Agrawal, Rakesh; and Srikant, Ramakrishnan; Fast algorithms for mining association rules in large databases Archived 2015-02-25
Well-separated pair decomposition (1,795 words) [view diff] case mismatch in snippet view article find links to article
1145/200836.200853. Bespamyatnikh, Sergei; Segal, Michael (2002). "Fast Algorithms for Approximating Distances". Algorithmica. 33 (2): 263–269. doi:10
Digital Audio Broadcasting (10,148 words) [view diff] case mismatch in snippet view article find links to article
(2017). Cosine-/Sine-Modulated Filter Banks: General Properties, Fast Algorithms and Integer Approximations. Springer. p. 478. ISBN 9783319610801. Archived
Coin problem (3,743 words) [view diff] exact match in snippet view article find links to article
{\displaystyle [0,ab-a-b]} , this gives the desired result. Formulae and fast algorithms are known for three numbers though the calculations can be very tedious
Euler's constant (9,614 words) [view diff] case mismatch in snippet view article find links to article
Eric W. "Euler–Mascheroni constant". MathWorld. Jonathan Sondow. Fast Algorithms and the FEE Method, E.A. Karatsuba (2005) Further formulae which make
Cooley–Tukey FFT algorithm (5,348 words) [view diff] exact match in snippet view article find links to article
seismological time series. However, analysis of this data would require fast algorithms for computing DFTs due to the number of sensors and length of time
Linear congruential generator (4,847 words) [view diff] exact match in snippet view article find links to article
operation in Schrage's method is the division (with remainder) of x by q; fast algorithms for division by a constant are not available since they also rely on
Synthetic-aperture radar (11,268 words) [view diff] exact match in snippet view article find links to article
majority of the spectral estimation algorithms, and there are many fast algorithms for computing the multidimensional discrete Fourier transform. Computational
Orthogonal frequency-division multiplexing (11,272 words) [view diff] exact match in snippet view article find links to article
1992). "Extended lapped transforms: properties, applications, and fast algorithms". IEEE Transactions on Signal Processing. 40 (11): 2703–2714. Bibcode:1992ITSP
Gröbner basis (10,068 words) [view diff] exact match in snippet view article find links to article
in the library Msolve. Beside Gröbner algorithms, Msolve contains fast algorithms for real-root isolation, and combines all these functions in an algorithm
Jane M. Carlton (1,584 words) [view diff] exact match in snippet view article find links to article
nº 6906; 498–511. 2002 with AL Delcher, A Phillippy, SL Salzberg, Fast algorithms for large-scale genome alignment and comparison, in: Nucleic Acids
Block-matching algorithm (2,643 words) [view diff] exact match in snippet view article find links to article
reduce the computational cost. It was one of the first widely accepted fast algorithms and frequently used for implementing earlier standards like MPEG 1
Symbolic artificial intelligence (11,042 words) [view diff] exact match in snippet view article find links to article
The approach advocated by Simon and Newell is to employ heuristics: fast algorithms that may fail on some inputs or output suboptimal solutions." Another
Maximal independent set (5,451 words) [view diff] exact match in snippet view article find links to article
558–565, doi:10.1137/0209042, S2CID 29527771. Leung, J. Y.-T. (1984), "Fast algorithms for generating all maximal independent sets of interval, circular-arc
Zernike polynomials (6,541 words) [view diff] exact match in snippet view article find links to article
found by solving a linear system, for instance by matrix inversion. Fast algorithms to calculate the forward and inverse Zernike transform use symmetry
Prefix sum (5,592 words) [view diff] exact match in snippet view article find links to article
as the underlying associative operation) can also be used to build fast algorithms for parallel polynomial interpolation. In particular, it can be used
Network motif (10,377 words) [view diff] exact match in snippet view article find links to article
a personal computer with average memory. ParaMODA and NemoMap are fast algorithms published in 2017 and 2018, respectively. They aren't as scalable as
Heronian triangle (6,015 words) [view diff] exact match in snippet view article find links to article
{A}{s(s-b)}},{\frac {A}{s(s-c)}}\right)\,.} Kurz (2008) has derived fast algorithms for generating Heronian triangles. There are infinitely many primitive
Multidimensional DSP with GPU acceleration (2,902 words) [view diff] exact match in snippet view article find links to article
difficult to process multidimensional signals in real-time. Although many fast algorithms (e.g. FFT) have been proposed for 1-D DSP problems, they are still
LP-type problem (4,687 words) [view diff] exact match in snippet view article find links to article
S2CID 14263014. Gupta, Prosenjit; Janardan, Ravi; Smid, Michiel (1996), "Fast algorithms for collision and proximity problems involving moving geometric objects"
Fully proportional representation (1,220 words) [view diff] exact match in snippet view article find links to article
Experiments on real-life preference-aggregation data shows that these fast algorithms in many cases find near-perfect solutions. Note that, once the k representatives
Polynomial matrix spectral factorization (3,089 words) [view diff] case mismatch in snippet view article find links to article
D.A.; Fiorentino, G.; Gemignani, L.; Meini, B. (2003). "Effective Fast Algorithms for Polynomial Spectral Factorization". Numerical Algorithms. 34 (2–4):
Quantitative comparative linguistics (7,245 words) [view diff] exact match in snippet view article find links to article
minimising the number of changes between each pair of taxa. There are fast algorithms for generating the collection of splits. The weights are determined
Anatoly Karatsuba (9,409 words) [view diff] exact match in snippet view article find links to article
automata theory and started a new branch in Mathematics, the theory of fast algorithms. In the paper of Edward F. Moore, ( n ; m ; p ) {\displaystyle (n;m;p)}
Alignment-free sequence analysis (6,400 words) [view diff] exact match in snippet view article find links to article
PMC 4080745. PMID 24700317. Apostolico A, Denas O (October 2008). "Fast algorithms for computing sequence distances by exhaustive substring composition"
Planar separator theorem (10,072 words) [view diff] exact match in snippet view article find links to article
1137/S0097539702419649, S2CID 5232238 Frederickson, Greg N. (1987), "Fast algorithms for shortest paths in planar graphs, with applications", SIAM Journal
Lattice of stable matchings (3,930 words) [view diff] exact match in snippet view article find links to article
doi:10.1145/3188745.3188848, MR 3826305 Gusfield, Dan (1987), "Three fast algorithms for four problems in stable marriage", SIAM Journal on Computing, 16
Verification-based message-passing algorithms in compressed sensing (3,524 words) [view diff] exact match in snippet view article find links to article
Applied Mathematics, 2008. Gilbert, Anna C., et al. "One sketch for all: fast algorithms for compressed sensing." Proceedings of the thirty-ninth annual ACM
Multidimensional empirical mode decomposition (7,060 words) [view diff] exact match in snippet view article find links to article
is often used for nonlinear geophysical data filtering due to its fast algorithms and its ability to handle large amount of data sets with the use of
Fixed-point computation (3,873 words) [view diff] case mismatch in snippet view article find links to article
Press. ISBN 978-0-19-510690-9.[page needed] Sikorski, K. (1989). "Fast Algorithms for the Computation of Fixed Points". Robustness in Identification
History of radio receivers (10,683 words) [view diff] case mismatch in snippet view article find links to article
(2017). Cosine-/Sine-Modulated Filter Banks: General Properties, Fast Algorithms and Integer Approximations. Springer. p. 478. ISBN 9783319610801. Pizzicato