Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 227,360,530 papers from all fields of science
Search
Sign In
Create Free Account
Recursion (computer science)
Known as:
Recursive algorithm
, Recursion(computer science)
, Recursive calls
Expand
Recursion in computer science is a method where the solution to a problem depends on solutions to smaller instances of the same problem (as opposed…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
50 relations
ALGOL 60
AP Computer Science
Adaptive quadrature
Algorithmic efficiency
Expand
Broader (1)
Theoretical computer science
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2008
Highly Cited
2008
Removal of Salt-and Pepper Noise in Images: A New Decision-Based Algorithm
M. S. Nair
,
K. Revathy
,
R. Tatavarti
2008
Corpus ID: 15385542
An improved decision-based algorithm for the restoration of gray-scale and color images that are highly corrupted by Salt-and…
Expand
Highly Cited
2005
Highly Cited
2005
Hardware-efficient distributed arithmetic architecture for high-order digital filters
H. Yoo
,
David V. Anderson
Proceedings. (ICASSP '05). IEEE International…
2005
Corpus ID: 3250083
The paper presents a new memory-efficient distributed arithmetic (DA) architecture for high-order FIR filters. The proposed…
Expand
Highly Cited
1997
Highly Cited
1997
Symbol-by-symbol MAP demodulation of CPM and PSK signals on Rayleigh flat-fading channels
M. Gertsman
,
J. Lodge
IEEE Transactions on Communications
1997
Corpus ID: 15892320
Demodulation using the symbol-by-symbol maximum a posteriori probability (MAP) algorithm is presented. The algorithm is derived…
Expand
Highly Cited
1996
Highly Cited
1996
MLSE for an unknown channel .I. Optimality considerations
K. Chugg
,
A. Polydoros
IEEE Transactions on Communications
1996
Corpus ID: 34599940
The problem of performing joint maximum-likelihood (ML) estimation of a digital sequence and unknown dispersive channel impulse…
Expand
Highly Cited
1993
Highly Cited
1993
Recursive motion and structure estimation with complete error characterization
Stefano Soatto
,
P. Perona
,
R. Frezza
,
G. Picci
Proceedings of IEEE Conference on Computer Vision…
1993
Corpus ID: 6632368
An algorithm that performs recursive estimation of ego-motion and ambient structure from a stream of monocular perspective images…
Expand
Highly Cited
1993
Highly Cited
1993
A Recursive Carry-Lookahead/Carry-Select Hybrid Adder
V. Kantabutra
IEEE Trans. Computers
1993
Corpus ID: 11925005
The author presents a very fast adder for double-precision mantissas, which is an improvement on T. Lynch and E. E. Swartzlandes…
Expand
Highly Cited
1991
Highly Cited
1991
Recursive Calculation of Survival Probabilities
David C. M. Dickson
,
H. Waters
ASTIN Bulletin: The Journal of the International…
1991
Corpus ID: 55535733
Abstract In this paper we present an algorithm for the approximate calculation of finite time survival probabilities for the…
Expand
Highly Cited
1989
Highly Cited
1989
Recursive speed and parameter estimation for induction machines
Miguel Velez-Reyes
,
K. Minami
,
G. Verghese
Conference Record of the IEEE Industry…
1989
Corpus ID: 14797455
A hierarchical recursive algorithm is presented to estimate the rotor speed and parameters of the induction machine on the basis…
Expand
Highly Cited
1987
Highly Cited
1987
Identification of nonlinear vibrating structures: Part I -- Formulation
S. Masri
,
Richard K. Miller
,
A. F. Saud
,
T. Caughey
1987
Corpus ID: 17013884
A self-starting multistage, time-domain procedure is presented for the identification of nonlinear, multi-degree-of-freedom…
Expand
Highly Cited
1970
Highly Cited
1970
Algorithms and recursive functions
A. I. Malʹt︠s︡ev
,
L. Boron
,
L. E. Sanchis
,
J. Stillwell
,
井関 清志
1970
Corpus ID: 119044543
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE