Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 238,080,812 papers from all fields of science
Search
Sign In
Create Free Account
Tree traversal
Known as:
Inorder walk
, Converse Postorder
, Pre-order traversal
Expand
In computer science, tree traversal (also known as tree search) is a form of graph traversal and refers to the process of visiting (checking and/or…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
49 relations
AlphaGo
Ancestral reconstruction
And–or tree
Array data structure
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
A Stitch in Time Saves Nine - SPARQL querying of Property Graphs using Gremlin Traversals
Harsh Thakkar
,
D. Punjani
,
Yashwant Keswani
,
Jens Lehmann
,
S. Auer
arXiv.org
2018
Corpus ID: 4665539
Knowledge graphs have become popular over the past years and frequently rely on the Resource Description Framework (RDF) or…
Expand
Highly Cited
2015
Highly Cited
2015
Hierarchical cost effective leach for heterogeneous wireless sensor networks
A. Roshini
,
H. Anandakumar
International Conference on Advanced Computing…
2015
Corpus ID: 15492374
Wireless sensor networks are those that are used for the communication between various sensor nodes to the base station…
Expand
2015
2015
Local region detector + CNN based landmarks for practical place recognition in changing environments
Peer Neubert
,
P. Protzel
European Conference on Mobile Robots
2015
Corpus ID: 10254934
Visual place recognition is a mature field in mobile robotics research. Recognizing places in datasets covering traversals of…
Expand
2015
2015
Columnar objects: improving the performance of analytical applications
Toni Mattis
,
Johannes Henning
,
Patrick Rein
,
R. Hirschfeld
,
M. Appeltauer
SIGPLAN symposium on New ideas, new paradigms…
2015
Corpus ID: 16288395
Growing volumes of data increase the demand to use it in analytical applications to make informed decisions. Unfortunately…
Expand
2006
2006
Unbiased MMSE Tree Search Detection for Multiple Antenna Systems
E. Zimmermann
,
G. Fettweis
2006
Corpus ID: 3073388
Tree search based detection techniques allow to achieve near-capacity performance in iterative receivers for multiple antenna…
Expand
2005
2005
Pattern lattice traversal by selective jumps
Osmar R Zaiane
,
Mohammad El-Hajj
Knowledge Discovery and Data Mining
2005
Corpus ID: 10693132
Regardless of the frequent patterns to discover, either the full frequent patterns or the condensed ones, either closed or…
Expand
2002
2002
Fast and Simple Occlusion Culling Using Hardware-based Depth Queries
B. Salomon
,
K. Hillesland
,
A. Lastra
,
Dinesh Manocha
2002
Corpus ID: 14687491
: We present a conservative occlusion culling algorithm for large environments. As part of a preprocess, we decompose the scene…
Expand
1996
1996
The detection of 2D image features using local energy
B. Robbins
1996
Corpus ID: 61013824
Accurate detection and localization of two-dimensional (2D) image features (or `keypoints') is important for vision tasks such as…
Expand
1995
1995
Computing the area versus delay trade-off curves in technology mapping
K. Chaudhary
,
Massoud Pedram
IEEE Trans. Comput. Aided Des. Integr. Circuits…
1995
Corpus ID: 6849688
We examine the problem of mapping a Boolean network using gates from a finite size cell library. The objective is to minimize the…
Expand
1990
1990
Formal Boolean manipulations for the verification of sequential machines
O. Coudert
,
C. Berthet
,
J. Madre
Proceedings of the European Design Automation…
1990
Corpus ID: 37878352
The paper addresses the problem of verifying synchronous sequential machines. It first shows that there is a certain class of…
Expand