Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 217,275,345 papers from all fields of science
Search
Sign In
Create Free Account
Recursion
Known as:
Recursionism
, Recursive structure
, Recursiveness
Expand
Recursion occurs when a thing is defined in terms of itself or of its type. Recursion is used in a variety of disciplines ranging from linguistics to…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
50 relations
Append
Barycentric subdivision
Beta BASIC
Byte pair encoding
Expand
Broader (1)
Self-reference
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2018
Highly Cited
2018
How Powerful are Graph Neural Networks?
Keyulu Xu
,
Weihua Hu
,
J. Leskovec
,
S. Jegelka
International Conference on Learning…
2018
Corpus ID: 52895589
Graph Neural Networks (GNNs) are an effective framework for representation learning of graphs. GNNs follow a neighborhood…
Expand
Highly Cited
2017
Highly Cited
2017
PointNet++: Deep Hierarchical Feature Learning on Point Sets in a Metric Space
C. Qi
,
L. Yi
,
Hao Su
,
L. Guibas
Neural Information Processing Systems
2017
Corpus ID: 1745976
Few prior works study deep learning on point sets. PointNet by Qi et al. is a pioneer in this direction. However, by design…
Expand
Highly Cited
2014
Highly Cited
2014
On the Properties of Neural Machine Translation: Encoder–Decoder Approaches
Kyunghyun Cho
,
B. V. Merrienboer
,
Dzmitry Bahdanau
,
Yoshua Bengio
SSST@EMNLP
2014
Corpus ID: 11336213
Neural machine translation is a relatively new approach to statistical machine translation based purely on neural networks. The…
Expand
Highly Cited
2011
Highly Cited
2011
Evaluation: from precision, recall and F-measure to ROC, informedness, markedness and correlation
D. Powers
arXiv.org
2011
Corpus ID: 3770261
Commonly used evaluation measures including Recall, Precision, F-Factor and Rand Accuracy are biased and should not be used…
Expand
Highly Cited
2006
Highly Cited
2006
On Model-Checking Trees Generated by Higher-Order Recursion Schemes
C. Ong
Logic in Computer Science
2006
Corpus ID: 11706854
We prove that the modal mu-calculus model-checking problem for (ranked and ordered) node-labelled trees that are generated by…
Expand
Highly Cited
2005
Highly Cited
2005
Consensus seeking in multiagent systems under dynamically changing interaction topologies
W. Ren
,
R. Beard
IEEE Transactions on Automatic Control
2005
Corpus ID: 12071837
This note considers the problem of information consensus among multiple agents in the presence of limited and unreliable…
Expand
Highly Cited
2003
Highly Cited
2003
An Introduction to the Kalman Filter
J. L. Roux
2003
Corpus ID: 14848980
,
Highly Cited
2002
Highly Cited
2002
Mean Shift: A Robust Approach Toward Feature Space Analysis
D. Comaniciu
,
P. Meer
IEEE Transactions on Pattern Analysis and Machine…
2002
Corpus ID: 691081
A general non-parametric technique is proposed for the analysis of a complex multimodal feature space and to delineate…
Expand
Highly Cited
1997
Highly Cited
1997
Differential Evolution – A Simple and Efficient Heuristic for global Optimization over Continuous Spaces
R. Storn
,
K. Price
Journal of Global Optimization
1997
Corpus ID: 5297867
A new heuristic approach for minimizing possiblynonlinear and non-differentiable continuous spacefunctions is presented. By means…
Expand
Highly Cited
1992
Highly Cited
1992
A new recursion-theoretic characterization of the polytime functions
S. Bellantoni
,
S. Cook
Symposium on the Theory of Computing
1992
Corpus ID: 27553006
We give a recursion-theoretic characterization of FP which describes polynomial time computation independently of any externally…
Expand
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