Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
fast algorithms
Description:
Fast algorithms are computational procedures designed to solve problems efficiently, often by reducing execution time or resource requirements.
Related topics:
Digital Filter Design and Implementation (10%),
Matrix Theory and Algorithms (9%)
OpenAlex ID:
keywords/fast-algorithms
Fast Algorithms for Mining Association Rules in Large Databases
1994
·
Rakesh Agrawal
, Ramakrishnan Srikant
·
Very Large Data Bases
·
9,418
Fast algorithm for detecting community structure in networks
2004
·
M. E. J. Newman
·
Physical Review E
·
5,534
PDF
Fast discovery of association rules
1996
·
Rakesh Agrawal
, Heikki Mannila
, et al.
·
Knowledge Discovery and Data Mining
·
2,372
A fast algorithm for nonlinearly constrained optimization calculations
1978
·
M. J. D. Powell
·
Lecture notes in mathematics
·
1,713
Fast computation of the kurtogram for the detection of transient faults
2006
·
Jérôme Antoni
·
Mechanical Systems and Signal Processing
·
1,656
A fast two-dimensional median filtering algorithm
1979
·
T. Huang
, G. Yang
, et al.
·
IEEE Transactions on Acoustics Speech and Signal Processing
·
1,432
Fast Normalized Cross-Correlation
2009
·
Jae-Chern Yoo
, Tae Hee Han
·
Circuits Systems and Signal Processing
·
1,149
A Fast Computational Algorithm for the Discrete Cosine Transform
1977
·
Wen-Hsiung Chen
, C. Smith
, et al.
·
IRE Transactions on Communications Systems
·
1,149
Fast algorithm for mining association rules
1994
·
R. K. Agrawal
·
Very Large Data Bases
·
911
Computing Fourier Transforms and Convolutions on the 2-Sphere
1994
·
J.R. Driscoll
, D.M. Healy
·
Advances in Applied Mathematics
·
897
Fast algorithm for spectral analysis of unevenly sampled data
1989
·
William H. Press
, George B. Rybicki
·
The Astrophysical Journal
·
776
The finite ridgelet transform for image representation
2003
·
M.N. Do
, M. Vetterli
·
IEEE Transactions on Image Processing
·
718
A fast algorithm for computing longest common subsequences
1977
·
James W. Hunt
, Thomas G. Szymanski
·
Communications of the ACM
·
691
PDF
A Fast Clustering-Based Feature Subset Selection Algorithm for High-Dimensional Data
2011
·
Qinbao Song
, Jingjie Ni
, et al.
·
IEEE Transactions on Knowledge and Data Engineering
·
674
Fast Algorithms for Digital Signal Processing
1985
·
Richard E. Blahut
·
667
The chirp z-transform algorithm
1969
·
L. Rabiner
, R. Schafer
, et al.
·
IEEE Transactions on Audio and Electroacoustics
·
654
A fast algorithm for computing multiplicative inverses in GF(2m) using normal bases
1988
·
Toshiya Itoh
, Shigeo Tsujii
·
Information and Computation
·
636
A new algorithm to compute the discrete cosine Transform
1984
·
Byeong Lee
·
IEEE Transactions on Acoustics Speech and Signal Processing
·
607
Fast algorithms for the discrete W transform and for the discrete Fourier transform
1984
·
Zhongde Wang
·
IEEE Transactions on Acoustics Speech and Signal Processing
·
599
Analyzing and comparing Montgomery multiplication algorithms
1996
·
C. Kaya Koc
, T. Acar
, et al.
·
IEEE Micro
·
567
Boundary Element Methods
2010
·
Stefan A. Sauter
, Christoph Schwab
·
Springer series in computational mathematics
·
558
Rapid calculation of terrain parameters for radiation modeling from digital elevation data
1990
·
J. Dozier
, J. Frew
·
IEEE Transactions on Geoscience and Remote Sensing
·
508
Hard Thresholding Pursuit: An Algorithm for Compressive Sensing
2011
·
Simon Foucart
·
SIAM Journal on Numerical Analysis
·
495
Fast Fourier Transform and Convolution Algorithms
1981
·
Henri J. Nussbaumer
·
Springer series in information sciences
·
469
Gradient Pursuits
2008
·
T. Blumensath
, M.E. Davies
·
IEEE Transactions on Signal Processing
·
468
PDF
Show more works
View as search
Works count:
6,909
Citation count:
109,800
Year
Topic
Type