Log in

Relevant bibliographies by topics / Tree matching / Journal articles

To see the other types of publications on this topic, follow the link: Tree matching.

Journal articles on the topic 'Tree matching'

Author: Grafiati

Published: 4 June 2021

Last updated: 26 July 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 journal articles for your research on the topic 'Tree matching.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

LU, JIANGUO, JU WANG, and SHENGRUI WANG. "XML SCHEMA MATCHING." International Journal of Software Engineering and Knowledge Engineering 17, no. 05 (2007): 575–97. http://dx.doi.org/10.1142/s0218194007003446.

Full text

Abstract:

XML Schema matching problem can be formulated as follows: given two XML Schemas, find the best mapping between the elements and attributes of the schemas, and the overall similarity between them. XML Schema matching is an important problem in data integration, schema evolution, and software reuse. This paper describes a matching system that can find accurate matches and scales to large XML Schemas with hundreds of nodes. In our system, XML Schemas are modeled as labeled and unordered trees, and the schema matching problem is turned into a tree matching problem. We proposed Approximate Common S

APA, Harvard, Vancouver, ISO, and other styles

2

Ko, Sang-Ki, Ha-Rim Lee, and Yo-Sub Han. "State Complexity of Regular Tree Languages for Tree Matching." International Journal of Foundations of Computer Science 27, no. 08 (2016): 965–79. http://dx.doi.org/10.1142/s0129054116500398.

Full text

Abstract:

We study the state complexity of regular tree languages for tree matching problem. Given a tree t and a set of pattern trees L, we can decide whether or not there exists a subtree occurrence of trees in L from the tree t by considering the new language L′ which accepts all trees containing trees in L as subtrees. We consider the case when we are given a set of pattern trees as a regular tree language and investigate the state complexity. Based on the sequential and parallel tree concatenation, we define three types of tree languages for deciding the existence of different types of subtree occu

APA, Harvard, Vancouver, ISO, and other styles

3

Chen, Yangjun, and Leping Zou. "Unordered tree matching and ordered tree matching: the evaluation of tree pattern queries." International Journal of Information Technology, Communications and Convergence 1, no. 3 (2011): 254. http://dx.doi.org/10.1504/ijitcc.2011.042125.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Christou, Michalis, Tomáš Flouri, Costas S. Iliopoulos, et al. "Tree template matching in unranked ordered trees." Journal of Discrete Algorithms 20 (May 2013): 51–60. http://dx.doi.org/10.1016/j.jda.2013.02.001.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

WANG, YANCHUN, WEIGANG SUN, JINGYUAN ZHANG, and SEN QIN. "ON THE CONDITIONAL MATCHING OF FRACTAL NETWORKS." Fractals 24, no. 04 (2016): 1650054. http://dx.doi.org/10.1142/s0218348x16500547.

Full text

Abstract:

In this paper, we propose a new matching (called a conditional matching), where the condition refers to the matching of the new constructed network which includes all the nodes in the original network. We then enumerate the conditional matchings of the new network and prove that the number of conditional matchings is just the product of degree sequences of the original network. We choose two families of fractal networks to show our obtained results, including the pseudofractal network and Cayley tree. Finally, we calculate the entropy of the conditional matchings on the considered networks and

APA, Harvard, Vancouver, ISO, and other styles

6

Ramesh, R., and I. V. Ramakrishnan. "Parallel tree pattern matching." Journal of Symbolic Computation 9, no. 4 (1990): 485–501. http://dx.doi.org/10.1016/s0747-7171(08)80023-5.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Krishna, V., N. Ranganathan, and A. Ejnioui. "A tree-matching chip." IEEE Transactions on Very Large Scale Integration (VLSI) Systems 7, no. 2 (1999): 277–80. http://dx.doi.org/10.1109/92.766755.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Dubiner, Moshe, Zvi Galil, and Edith Magen. "Faster tree pattern matching." Journal of the ACM 41, no. 2 (1994): 205–13. http://dx.doi.org/10.1145/174652.174653.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Purdom, Paul Walton, and Cynthia A. Brown. "Tree matching and simplification." Software: Practice and Experience 17, no. 2 (1987): 105–15. http://dx.doi.org/10.1002/spe.4380170203.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Yu, Shuchun, Yupeng He, Zhifeng Chen, Changhai Ru, and Ming Pang. "Stereo Matching Method Based on Combination Characteristic Cost Computing and Unstable Tree Reconstruction Optimization and Its Application in Medical Images." Journal of Medical Imaging and Health Informatics 10, no. 3 (2020): 646–53. http://dx.doi.org/10.1166/jmihi.2020.2912.

Full text

Abstract:

This study aimed to propose a stereo matching method based on the cost calculation of combination feature and reconstruction optimization of an unstable tree. For cost calculation, the improved Census transform was used to calculate the illumination characteristics, the color and gradient operators were used to calculate the color features, and the LBP (Local Binary Pattern) operator was used to calculate the texture features. Then, the initial matching cost was calculated by combining all three features. For cost aggregation, the minimum spanning tree algorithm was improved and the tree aggre

APA, Harvard, Vancouver, ISO, and other styles

11

Wang, Wen-Huan, and Chun-Xiang Zhai. "Minimal Estrada index of the trees without perfect matchings." Electronic Journal of Linear Algebra 35 (February 1, 2019): 408–17. http://dx.doi.org/10.13001/1081-3810.3355.

Full text

Abstract:

Trees possessing no Kekul Ìe structures (i.e., perfect matching) with the minimal Estrada index are considered. Let T_n be the set of the trees having no perfect matchings with n vertices. When n is odd and n â¥ 5, the trees with the smallest and the second smallest Estrada indices among T_n are obtained. When n is even and n â¥ 6, the tree with the smallest Estrada index in T_n is deduced.

APA, Harvard, Vancouver, ISO, and other styles

12

Bunke, H., and B. T. Messmer. "Recent Advances in Graph Matching." International Journal of Pattern Recognition and Artificial Intelligence 11, no. 01 (1997): 169–203. http://dx.doi.org/10.1142/s0218001497000081.

Full text

Abstract:

A powerful and universal data structure with applications invarious subfields of science and engineering is graphs. In computer vision and image analysis, graphs are often used for the representation of structured objects. For example, if the problem is to recognize instances of known objects in an image, then often models, or prototypes, of the known objects are represented by means of graphs and stored in a database. The unknown objects in the input image are extracted by means of suitable preprocessing and segmentation algorithms, and represented by graphs that are analogous to the model gr

APA, Harvard, Vancouver, ISO, and other styles

13

HUA, HONGBO. "ON MAXIMAL ENERGY AND HOSOYA INDEX OF TREES WITHOUT PERFECT MATCHING." Bulletin of the Australian Mathematical Society 81, no. 1 (2009): 47–57. http://dx.doi.org/10.1017/s0004972709000562.

Full text

Abstract:

AbstractLet G be a simple undirected graph. The energy E(G) of G is the sum of the absolute values of the eigenvalues of the adjacent matrix of G, and the Hosoya index Z(G) of G is the total number of matchings in G. A tree is called a nonconjugated tree if it contains no perfect matching. Recently, Ou [‘Maximal Hosoya index and extremal acyclic molecular graphs without perfect matching’, Appl. Math. Lett.19 (2006), 652–656] determined the unique element which is maximal with respect to Z(G) among the family of nonconjugated n-vertex trees in the case of even n. In this paper, we provide a cou

APA, Harvard, Vancouver, ISO, and other styles

14

Travnícek, J., J. Janousek, and B. Melichar. "Indexing ordered trees for (nonlinear) tree pattern matching by pushdown automata." Computer Science and Information Systems 9, no. 3 (2012): 1125–53. http://dx.doi.org/10.2298/csis111220024t.

Full text

Abstract:

Trees are one of the fundamental data structures used in Computer Science. We present a new kind of acyclic pushdown automata, the tree pattern pushdown automaton and the nonlinear tree pattern pushdown automaton, constructed for an ordered tree. These automata accept all tree patterns and nonlinear tree patterns, respectively, which match the tree and represent a full index of the tree for such patterns. Given a tree with n nodes, the numbers of these distinct tree patterns and nonlinear tree patterns can be at most 2n?1 +n and at most (2+v)n?1+2, respectively, where v is the maximal number o

APA, Harvard, Vancouver, ISO, and other styles

15

Cheng, Yao-Chou, and Shin-Yee Lu. "Waveform Correlation by Tree Matching." IEEE Transactions on Pattern Analysis and Machine Intelligence PAMI-7, no. 3 (1985): 299–305. http://dx.doi.org/10.1109/tpami.1985.4767658.

Full text

APA, Harvard, Vancouver, ISO, and other styles

16

Yang, Qingxiong. "Stereo Matching Using Tree Filtering." IEEE Transactions on Pattern Analysis and Machine Intelligence 37, no. 4 (2015): 834–46. http://dx.doi.org/10.1109/tpami.2014.2353642.

Full text

APA, Harvard, Vancouver, ISO, and other styles

17

Xu, Zihuan, Kewei Cheng, Yi Ding, Ziqiang Tian, and Hui Zhao. "A Multiple Genome Sequence Matching Based on Skipping Tree." International Journal of Machine Learning and Computing 5, no. 1 (2015): 78–85. http://dx.doi.org/10.7763/ijmlc.2015.v5.487.

Full text

APA, Harvard, Vancouver, ISO, and other styles

18

Cole, Richard, and Ramesh Hariharan. "Tree Pattern Matching to Subset Matching in Linear Time." SIAM Journal on Computing 32, no. 4 (2003): 1056–66. http://dx.doi.org/10.1137/s0097539700382704.

Full text

APA, Harvard, Vancouver, ISO, and other styles

19

Zhang, Zhi Yuan, Yu Jie Wang, Xue Hu Huang, and Kai Leung Yung. "Concept Tree-Based Event Matching Algorithm in Publish/Subscribe Systems." Scientific Programming 2022 (August 31, 2022): 1–13. http://dx.doi.org/10.1155/2022/3943442.

Full text

Abstract:

Semantic-based publish/subscribe system has attracted a lot of attention in recent years due to its powerful description ability in message dissemination scenarios. As a key part of semantic-based publish/subscribe systems, event matching needs to understand the semantic meaning of subscriptions, especially the hierarchy of concepts. However, existing event matching algorithms are severely affected by the complexity of concept hierarchy trees, some even cannot run due to high memory occupation. This article proposes an event matching algorithm called CTPS (concept tree-based publish/subscribe

APA, Harvard, Vancouver, ISO, and other styles

20

CLEOPHAS, LOEK, KEES HEMERIK, and GERARD ZWAAN. "TWO RELATED ALGORITHMS FOR ROOT-TO-FRONTIER TREE PATTERN MATCHING." International Journal of Foundations of Computer Science 17, no. 06 (2006): 1253–72. http://dx.doi.org/10.1142/s012905410600439x.

Full text

Abstract:

Tree pattern matching (TPM) algorithms on ordered, ranked trees play an important role in applications such as compilers and term rewriting systems. Many TPM algorithms appearing in the literature are based on tree automata. For efficiency, these automata should be deterministic, yet deterministic root-to-frontier tree automata (DRFTAS) are less powerful than nondeterministic ones, and no root-to-frontier TPM algorithm using a DRFTA has appeared so far. Hoffmann & O'Donnell presented a root-to-frontier TPM algorithm based on an Aho-Corasick automaton recognizing tree stringpaths. No relati

APA, Harvard, Vancouver, ISO, and other styles

21

Su, Jing, Hongyu Wang, and Bing Yao. "Matching-Type Image-Labelings of Trees." Mathematics 9, no. 12 (2021): 1393. http://dx.doi.org/10.3390/math9121393.

Full text

Abstract:

A variety of labelings on trees have emerged in order to attack the Graceful Tree Conjecture, but lack showing the connections between two labelings. In this paper, we propose two new labelings: vertex image-labeling and edge image-labeling, and combine new labelings to form matching-type image-labeling with multiple restrictions. The research starts from the set-ordered graceful labeling of the trees, and we give several generation methods and relationships for well-known labelings and two new labelings on trees.

APA, Harvard, Vancouver, ISO, and other styles

22

Xiang, Qing Quan, Zhe Lv, and Pei Li Qiao. "An Improvement Measure to AC-BM Pattern Matching Algorithm in Intrusion Defense System." Applied Mechanics and Materials 344 (July 2013): 234–37. http://dx.doi.org/10.4028/www.scientific.net/amm.344.234.

Full text

Abstract:

Pattern matching algorithm is a key technology of intrusion defense system in computer network. Based on the pattern matching algorithm AC-BM, This paper proposes an structure of binary tree to express the pattern tree , the structure model of binary tree can reduce the time of forming pattern tree, and then through the using of improved BMHS algorithm of bad character, the algorithm can increase moving distance of pattern tree decrease the matching time, and promote the speed of pattern matching. The experimental data show that, through the improvement of AC-BM algorithm, it indeed can improv

APA, Harvard, Vancouver, ISO, and other styles

23

Kuzmin, Nikita A. "On radius 2 trees with the maximum number of matchings." Zhurnal Srednevolzhskogo Matematicheskogo Obshchestva 22, no. 2 (2020): 177–87. http://dx.doi.org/10.15507/2079-6900.22.202002.177-187.

Full text

Abstract:

A matching in a graph is any set of its pairwise non-adjacent edges. In this paper, we consider and solve the maximization problem of the matchings number in radius ≤2 trees of a given number of vertices. For any n≥56, where n=3k+r and k∈N,r∈{0,1,2}, an extremal tree is unique and it is a join of a vertex with the central vertices in b copies of P3 and with leaf vertices in a copies of P2, where b=k+r−1−2a3 and (r,a)∈{(0,1),(1,0),(2,2)}. For any 6≤n≤55, a corresponding extremal tree is also unique (except n=8, where there are two such trees) and it has a similar structure. For any 1≤n≤5, a uni

APA, Harvard, Vancouver, ISO, and other styles

24

Flouri, Tomáš, Costas S. Iliopoulos, Jan Janoušek, Bořivoj Melichar, and Solon P. Pissis. "Tree template matching in ranked ordered trees by pushdown automata." Journal of Discrete Algorithms 17 (December 2012): 15–23. http://dx.doi.org/10.1016/j.jda.2012.10.003.

Full text

APA, Harvard, Vancouver, ISO, and other styles

25

Gagie, Travis, Danny Hermelin, Gad M. Landau, and Oren Weimann. "Binary Jumbled Pattern Matching on Trees and Tree-Like Structures." Algorithmica 73, no. 3 (2014): 571–88. http://dx.doi.org/10.1007/s00453-014-9957-6.

Full text

APA, Harvard, Vancouver, ISO, and other styles

26

Xu, Yi, Tiejun Wang, Andrew K. Skidmore, and Tawanda W. Gara. "A Novel Approach to Match Individual Trees between Aerial Photographs and Airborne LiDAR Data." Remote Sensing 15, no. 17 (2023): 4128. http://dx.doi.org/10.3390/rs15174128.

Full text

Abstract:

Integrating multimodal remote sensing data can optimize the mapping accuracy of individual trees. Yet, one issue that is not trivial but generally overlooked in previous studies is the spatial mismatch of individual trees between remote sensing datasets, especially in different imaging modalities. These offset errors between the same tree on different data that have been geometrically corrected can lead to substantial inaccuracies in applications. In this study, we propose a novel approach to match individual trees between aerial photographs and airborne LiDAR data. To achieve this, we first l

APA, Harvard, Vancouver, ISO, and other styles

27

ŽĎÁREK, JAN, and BOŘIVOJ MELICHAR. "TREE-BASED 2D INDEXING." International Journal of Foundations of Computer Science 22, no. 08 (2011): 1893–907. http://dx.doi.org/10.1142/s0129054111009100.

Full text

Abstract:

A new approach to the 2D pattern matching and specifically to 2D text indexing is proposed. A transformation of a 2D text into the form of a tree is presented. It preserves the context of each element of the 2D text. The tree can be linearised using the prefix notation into the form of a string (a linear text) and the pattern matching is performed in this text. Pushdown automata indexing the 2D text are constructed over the tree representation. They allow to search for 2D prefixes, 2D suffixes, and 2D factors of the 2D text in time proportional to the size of the representation of a 2D pattern

APA, Harvard, Vancouver, ISO, and other styles

28

Xinying Song, and Johnson Apacible. "Fast Tree Matching for Web Mining." Journal of Convergence Information Technology 8, no. 8 (2013): 1–9. http://dx.doi.org/10.4156/jcit.vol8.issue8.1.

Full text

APA, Harvard, Vancouver, ISO, and other styles

29

Yahya Mohamed, S., and S. Suganthi. "MATCHING DOMINATION IN FUZZY LABELING TREE." Advances in Mathematics: Scientific Journal 9, no. 9 (2020): 6837–44. http://dx.doi.org/10.37418/amsj.9.9.42.

Full text

APA, Harvard, Vancouver, ISO, and other styles

30

Fogla, P., and W. Lee. "q-gram matching using tree models." IEEE Transactions on Knowledge and Data Engineering 18, no. 4 (2006): 433–47. http://dx.doi.org/10.1109/tkde.2006.1599383.

Full text

APA, Harvard, Vancouver, ISO, and other styles

31

Tsong-Li Wang, J., Kaizhong Zhang, K. Jeong, and D. Shasha. "A system for approximate tree matching." IEEE Transactions on Knowledge and Data Engineering 6, no. 4 (1994): 559–71. http://dx.doi.org/10.1109/69.298173.

Full text

APA, Harvard, Vancouver, ISO, and other styles

32

CHIEN, BEEN-CHIAN, and SHIANG-YI HE. "A LEXICAL DECISION TREE SCHEME FOR SUPPORTING SCHEMA MATCHING." International Journal of Information Technology & Decision Making 10, no. 03 (2011): 519–37. http://dx.doi.org/10.1142/s0219622011004439.

Full text

Abstract:

To manipulate semantic web and integrate different data sources efficiently, automatic schema matching plays a key role. A generic schema matching method generally includes two phases: the linguistic similarity matching phase and the structural similarity matching phase. Since linguistic matching is an essential step for effective schema matching, developing a high accurate linguistic similarity matching scheme is required. In this paper, a schema matching approach called Similarity Yield Matcher (SYM) is proposed. In SYM, a lexical decision tree is presented to determine the linguistic simila

APA, Harvard, Vancouver, ISO, and other styles

33

Trávníček, Jan, Tomáš Pecka, Robin Obůrka, and Jan Janoušek. "Forward linearised tree pattern matching using tree pattern border array." Discrete Applied Mathematics 352 (July 2024): 33–43. http://dx.doi.org/10.1016/j.dam.2024.03.014.

Full text

APA, Harvard, Vancouver, ISO, and other styles

34

Hsin, Hsi Chin, Tze-Yun Sung, Yaw-Shih Shieh, and Carlo Cattani. "A New Texture Synthesis Algorithm Based on Wavelet Packet Tree." Mathematical Problems in Engineering 2012 (2012): 1–12. http://dx.doi.org/10.1155/2012/305384.

Full text

Abstract:

This paper presents an efficient texture synthesis based on wavelet packet tree (TSWPT). It has the advantage of using a multiresolution representation with a greater diversity of bases functions for the nonlinear time series applications such as fractal images. The input image is decomposed into wavelet packet coefficients, which are rearranged and organized to form hierarchical trees called wavelet packet trees. A 2-step matching, that is, coarse matching based on low-frequency wavelet packet coefficients followed by fine matching based on middle-high-frequency wavelet packet coefficients, i

APA, Harvard, Vancouver, ISO, and other styles

35

Zhou, Shu Min, Rui Chen, and Bin Tang. "Address Analyzer Based on the Maximum Matching Algorithms." Key Engineering Materials 460-461 (January 2011): 296–99. http://dx.doi.org/10.4028/www.scientific.net/kem.460-461.296.

Full text

Abstract:

Based on the analysis of current zip code, this article put forward a new encoding algorithm of the address tree - the largest matching algorithm. This algorithm combines the characteristics of the address tree, considering the uniqueness of the address tree, raises a best matching theory, and taking into the matching speed of the address tree, brings in the associate floors of the node of the address tree to improve the efficiency of the match. Because of the change of the address tree, the address tree’s thesaurus in order to timely update its information, increase unknown node by intelligen

APA, Harvard, Vancouver, ISO, and other styles

36

Zhao, Yijiu, Xiaoyan Zhuang, Zhijian Dai, and Houjun Wang. "Wavelet Compressive Sampling Signal Reconstruction Using Upside-Down Tree Structure." Mathematical Problems in Engineering 2011 (2011): 1–10. http://dx.doi.org/10.1155/2011/606974.

Full text

Abstract:

This paper suggests an upside-down tree-based orthogonal matching pursuit (UDT-OMP) compressive sampling signal reconstruction method in wavelet domain. An upside-down tree for the wavelet coefficients of signal is constructed, and an improved version of orthogonal matching pursuit is presented. The proposed algorithm reconstructs compressive sampling signal by exploiting the upside-down tree structure of the wavelet coefficients of signal besides its sparsity in wavelet basis. Compared with conventional greedy pursuit algorithms: orthogonal matching pursuit (OMP) and tree-based orthogonal mat

APA, Harvard, Vancouver, ISO, and other styles

37

Tianyang, Dong, Zhang Jian, Gao Sibin, Shen Ying, and Fan Jing. "Single-Tree Detection in High-Resolution Remote-Sensing Images Based on a Cascade Neural Network." ISPRS International Journal of Geo-Information 7, no. 9 (2018): 367. http://dx.doi.org/10.3390/ijgi7090367.

Full text

Abstract:

Traditional single-tree detection methods usually need to set different thresholds and parameters manually according to different forest conditions. As a solution to the complicated detection process for non-professionals, this paper presents a single-tree detection method for high-resolution remote-sensing images based on a cascade neural network. In this method, we firstly calibrated the tree and non-tree samples in high-resolution remote-sensing images to train a classifier with the backpropagation (BP) neural network. Then, we analyzed the differences in the first-order statistic features,

APA, Harvard, Vancouver, ISO, and other styles

38

Bu, Penghui, Hang Wang, Yihua Dou, and Hong Zhao. "Linear Time Non-Local Cost Aggregation on Complementary Spatial Tree Structures." Applied Sciences 13, no. 21 (2023): 11892. http://dx.doi.org/10.3390/app132111892.

Full text

Abstract:

Studies on many dense correspondence tasks in the field of computer vision attempt to find spatially smooth results. A typical way to solve these problems is by smoothing the matching costs using edge-preserving filters. However, local filters generate locally optimal results, in that they only take the costs over a small support window into account, and non-local filters based on a minimum spanning tree (MST) tend to overuse the piece-wise constant assumption. In this paper, we propose a linear time non-local cost aggregation method based on two complementary spatial tree structures. The geod

APA, Harvard, Vancouver, ISO, and other styles

39

Yahya Mohamed, S., and S. Suganthi. "Some parameters of fuzzy labeling tree using matching and perfect matching." Malaya Journal of Matematik S, no. 1 (2020): 511–14. http://dx.doi.org/10.26637/mjm0s20/0097.

Full text

APA, Harvard, Vancouver, ISO, and other styles

40

Lahoda, Jan, and Jan Žd’árek. "Simple tree pattern matching for trees in the prefix bar notation." Discrete Applied Mathematics 163 (January 2014): 343–51. http://dx.doi.org/10.1016/j.dam.2013.07.018.

Full text

APA, Harvard, Vancouver, ISO, and other styles

41

Borgaonkar, H. P., Nathsuda Pumijumnong, B. M. Buckley, O. Taesumrith, and S. Chutiwat. "Tree-ring Analysis of teak (Tectona grandis) ring width chronology from Mae Na, Thailand." Journal of Palaeosciences 50, no. (1-3) (2001): 41–45. http://dx.doi.org/10.54991/jop.2001.1803.

Full text

Abstract:

Tree-ring analysis of about 39 core samples of teak (Tectona grandis) collected from undisturbed natural forests near Mae Na, Thailand was carried out. All samples show good cross matching within the tree and between the trees. Chronology statistics indicate the usefulness of the species in dendroclimatic studies. Tree growth -climate relationship based on correlation and response function analysis revealed the important role of precipitation during the monsoon months.

APA, Harvard, Vancouver, ISO, and other styles

42

Oya, N., M. Rusdi, Y. D. Fazlina, and S. Sugianto. "Template matching method to determine oil palm trees." IOP Conference Series: Earth and Environmental Science 1183, no. 1 (2023): 012077. http://dx.doi.org/10.1088/1755-1315/1183/1/012077.

Full text

Abstract:

Abstract Palm oil is one of the leading plantation sectors in Indonesia. Palm oil product which consists of crude palm oil and palm kernel oil has a high economic value. Indonesia has an area of 34.18% of the world’s oil palm plantations. Aceh province is recorded to have an area of oil palm reaching 488 thousand hectares in 2020, with an area of oil palm plantations owned by Indonesia, especially Aceh, making a palm oil counting process to calculate the amount of fertilizer used in each tree circumference and calculate the amount of oil palm production into work which takes time and price is

APA, Harvard, Vancouver, ISO, and other styles

43

Chen, Yangjun, and Leping Zou. "Efficient Streaming Algorithms for Tree Matching Problems." International Journal of Computer Science and Artificial Intelligence 2, no. 4 (2012): 1–13. http://dx.doi.org/10.5963/ijcsai0204001.

Full text

APA, Harvard, Vancouver, ISO, and other styles

44

KumarSahu, Subrat, Sruti Sahani, Pradeep Kumar Jena, and Subhagata Chattopadhyay. "Fingerprint Identification System using Tree Based Matching." International Journal of Computer Applications 53, no. 10 (2012): 11–16. http://dx.doi.org/10.5120/8455-2259.

Full text

APA, Harvard, Vancouver, ISO, and other styles

45

ZHOU, Ya-Qian. "A Feature Matching Method: Sparse Feature Tree." Journal of Software 17, no. 5 (2006): 1026. http://dx.doi.org/10.1360/jos171026.

Full text

APA, Harvard, Vancouver, ISO, and other styles

46

Kashkoush, Mohamed, and Hoda ElMaraghy. "Matching Bills of Materials Using Tree Reconciliation." Procedia CIRP 7 (2013): 169–74. http://dx.doi.org/10.1016/j.procir.2013.05.029.

Full text

APA, Harvard, Vancouver, ISO, and other styles

47

Erdem, Oğuzhan. "Tree-based string pattern matching on FPGAs." Computers & Electrical Engineering 49 (January 2016): 117–33. http://dx.doi.org/10.1016/j.compeleceng.2015.11.025.

Full text

APA, Harvard, Vancouver, ISO, and other styles

48

Bille, Philip, Patrick Hagge Cording, and Inge Li Gørtz. "Compressed Subsequence Matching and Packed Tree Coloring." Algorithmica 77, no. 2 (2015): 336–48. http://dx.doi.org/10.1007/s00453-015-0068-9.

Full text

APA, Harvard, Vancouver, ISO, and other styles

49

Sastry, R., and N. Ranganathan. "A VLSI architecture for approximate tree matching." IEEE Transactions on Computers 47, no. 3 (1998): 346–52. http://dx.doi.org/10.1109/12.660171.

Full text

APA, Harvard, Vancouver, ISO, and other styles

50

Wu, Xin, and Guiquan Liu. "XML twig pattern matching using version tree." Data & Knowledge Engineering 64, no. 3 (2008): 580–99. http://dx.doi.org/10.1016/j.datak.2007.09.013.

Full text

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!