Results 11 to 20 of about 429,086 (268)
Structural Decomposition Trees [PDF]
Computer Graphics Forum, 2011 AbstractResearchers and analysts in modern industrial and academic environments are faced with a daunting amount of multi‐dimensional data. While there has been significant development in the areas of data mining and knowledge discovery, there is still the need for improved visualizations and generic solutions.
Daniel Engel +3 more
openaire +1 more source
Remote Sensing, 2023 Eucalyptus plantation forests in southern China provide not only the economic value of producing timber, but also the ecological value service of absorbing carbon dioxide and releasing oxygen.
Guangpeng Fan +7 more
doaj +1 more source
Tree 2 – Decision Trees for Tree Structured Data [PDF]
, 2005 We present Tree2, a new approach to structural classification. This integrated approach induces decision trees that test for pattern occurrence in the inner nodes. It combines state-of-the-art tree mining with sophisticated pruning techniques to find the most discriminative pattern in each node. In contrast to existing methods, Tree2 uses no heuristics
Bringmann, Björn, Zimmermann, Albrecht
openaire +1 more source
Message Integration Authentication in the Internet-of-Things via Lattice-Based Batch Signatures
Sensors, 2018 The internet-of-things (also known as IoT) connects a large number of information-sensing devices to the Internet to collect all kinds of information needed in real time.
Xiuhua Lu +5 more
doaj +1 more source
A hierarchy of tree-automatic structures [PDF]
The Journal of Symbolic Logic, 2012 AbstractWe considerωn-automatic structures which are relational structures whose domain and relations are accepted by automata reading ordinal words of lengthωnfor some integern≥ 1. We show that all these structures areω-tree-automatic structures presentable by Muller or Rabin tree automata.
Olivier Finkel, Stevo Todorcevic
openaire +4 more sources
A data structure for dynamic trees [PDF]
Journal of Computer and System Sciences, 1981 AbstractA data structure is proposed to maintain a collection of vertex-disjoint trees under a sequence of two kinds of operations: a link operation that combines two trees into one by adding an edge, and a cut operation that divides one tree into two by deleting an edge. Each operation requires O(log n) time.
Daniel Dominic Sleator +1 more
openaire +2 more sources
Deleting to Structured Trees [PDF]
, 2019 16 pages, 4 figures. A shorter version of this work was published in the proceedings of the 25th International Computing and Combinatorics Conference (COCOON 2019)
Pratyush Dayal, Neeldhara Misra
openaire +2 more sources
Continuous location privacy protection mechanism based on differential privacy
Tongxin xuebao, 2021 Aiming at the problem of users’ location privacy leakage caused by continuously using LBS, a road privacy level (RPL) algorithm was proposed based on road topological network, which divided the privacy level of the road sections around the sensitive ...
Hongtao LI +3 more
doaj
The Forestry Chronicle, 2019 Tree-related microhabitats (hereafter “TreMs”) play a key role in forest biodiversity. However, harvesting may cause their erosion. In North America, knowledge about TreMs is still lacking but defect surveys are largely available in managed forests.
Maxence Martin, Patricia Raymond
doaj +1 more source
IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing, 2020 Estimating individual tree structures from 3-D space may improve the biomass statistics of the urban forest and provide tree-level information for ecological studies.
Sheng Xu +3 more
doaj +1 more source