Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Recursion (computer science)

Known as: Recursive algorithm, Recursion(computer science), Recursive calls 
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

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2014
Highly Cited
2014
During the late 1990s, Huang introduced the algorithm called Empirical Mode Decomposition, which is widely used today to… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 6
Is this relevant?
Highly Cited
2013
Highly Cited
2013
Semantic word spaces have been very useful but cannot express the meaning of longer phrases in a principled way. Further progress… Expand
  • figure 1
  • figure 3
  • figure 2
  • table 1
  • table 2
Is this relevant?
Highly Cited
2006
Highly Cited
2006
We describe novel computational techniques for constructing induction rules for deductive synthesis proofs. Deductive synthesis… Expand
  • figure 3
  • figure 6
  • table 1
Is this relevant?
Highly Cited
2004
Highly Cited
2004
DNA micro-arrays now permit scientists to screen thousands of genes simultaneously and determine whether those genes are active… Expand
  • figure 1
  • figure 2
  • table 1
  • table 2
  • table 3
Is this relevant?
Highly Cited
2004
Highly Cited
2004
The lectures will introduce the kernel methods approach to pattern analysis [1] through the particular example of support vector… Expand
Is this relevant?
Highly Cited
2000
Highly Cited
2000
Recursive methods offer a powerful approach in dynamic macroeconomics. This book contains both an introduction to recursive tools… Expand
  • figure 1.2
  • figure 5.6
  • figure 6.2
  • figure 6.4
  • figure 6.5
Is this relevant?
Highly Cited
1993
Highly Cited
1993
A new class of convolutional codes called turbo-codes, whose performances in terms of bit error rate (BER) are close to the… Expand
Is this relevant?
Highly Cited
1993
Highly Cited
1993
We describe a recursive algorithm to compute representations of functions with respect to nonorthogonal and possibly overcomplete… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1969
Highly Cited
1969
Central concerns of the book are related theories of recursively enumerable sets, of degree of un-solvability and turing degrees… Expand
Is this relevant?
Highly Cited
1962
Highly Cited
1962
procedure ari thmetic (a, b, c, op); in t eger a, b, c, op; ¢ o n l m e n t This procedure will perform different order ar i… Expand
Is this relevant?