Se connecter

Bibliographies thématiques / Trie Tree

Sommaire

Articles de revues
Thèses
Livres
Chapitres de livres
Actes de conférences
Rapports d'organisations

Littérature scientifique sur le sujet « Trie Tree »

Auteur : Grafiati

Publié le 14 décembre 2024

Créez une référence correcte selon les styles APA, MLA, Chicago, Harvard et plusieurs autres

Choisissez une source :

Consultez les listes thématiques d’articles de revues, de livres, de thèses, de rapports de conférences et d’autres sources académiques sur le sujet « Trie Tree ».

À côté de chaque source dans la liste de références il y a un bouton « Ajouter à la bibliographie ». Cliquez sur ce bouton, et nous générerons automatiquement la référence bibliographique pour la source choisie selon votre style de citation préféré : APA, MLA, Harvard, Vancouver, Chicago, etc.

Vous pouvez aussi télécharger le texte intégral de la publication scolaire au format pdf et consulter son résumé en ligne lorsque ces informations sont inclues dans les métadonnées.

Articles de revues sur le sujet "Trie Tree"

1

Dorokhina, Galina. "Phoneme-by-Phoneme Speech Recognition as a Classification of Series on a Set of Sequences of Elements of Complex Objects Using an Improved Trie-Tree." Informatics and Automation 23, no. 6 (2024): 1784–822. http://dx.doi.org/10.15622/ia.23.6.8.

Texte intégral

Résumé :

Sequences, including vector sequences, are applicable in any subject domains. Sequences of scalar values or vectors (series) can be produced by higher-order sequences, for example: a series of states, or elements of complex objects. This academic paper is devoted to the application of an improved trie-tree in the classification of series on a set of sequences of elements of complex objects using the dynamic programming method. The implementation areas of dynamic programming have been considered. It has been shown that dynamic programming is adapted to multi-step operations of calculating addit

Styles APA, Harvard, Vancouver, ISO, etc.

2

SHI, Chang-qiong, Ming TANG, Da-fang ZHANG, and Kai-qing ZHOU. "Hash table based on Trie-tree." Journal of Computer Applications 30, no. 8 (2010): 2193–96. http://dx.doi.org/10.3724/sp.j.1087.2010.02193.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

3

Schmeißer, Josef, Maximilian E. Schüle, Viktor Leis, Thomas Neumann, and Alfons Kemper. "B2-Tree: Page-Based String Indexing in Concurrent Environments." Datenbank-Spektrum 22, no. 1 (2022): 11–22. http://dx.doi.org/10.1007/s13222-022-00409-y.

Texte intégral

Résumé :

AbstractRecently proposed index structures, that combine trie-based and comparison-based search mechanisms, considerably improve retrieval throughput for in-memory database systems. However, most of these index structures allocate small memory chunks when required. This stands in contrast to block-based index structures, that are necessary for disk-accesses of beyond main-memory database systems such as Umbra. We therefore present the B2-tree. The outer structure is identical to that of an ordinary B+-tree. It still stores elements in a dense array in sorted order, enabling efficient range sca

Styles APA, Harvard, Vancouver, ISO, etc.

4

CARON, EDDY, FRÉDÉRIC DESPREZ, FRANCK PETIT, and CÉDRIC TEDESCHI. "SNAP-STABILIZING PREFIX TREE FOR PEER-TO-PEER SYSTEMS." Parallel Processing Letters 20, no. 01 (2010): 15–30. http://dx.doi.org/10.1142/s012962641000003x.

Texte intégral

Résumé :

Several factors still hinder the deployment of computational grids over large scale platforms. Among them, the resource discovery is one crucial issue. New approaches, based on peer-to-peer technologies, tackle this issue. Because they efficiently allow range queries, Tries (a.k.a., Prefix Trees) appear to be among promising ways in the design of distributed data structures indexing resources. Despite their lack of robustness in dynamic settings, trie-structured approaches outperform other peer-to-peer fashioned technologies by efficiently supporting range queries. Within recent trie-based app

Styles APA, Harvard, Vancouver, ISO, etc.

5

Abdullah, Zailani, Tutut Herawan, A. Noraziah, and Mustafa Mat Deris. "A Scalable Algorithm for Constructing Frequent Pattern Tree." International Journal of Intelligent Information Technologies 10, no. 1 (2014): 42–56. http://dx.doi.org/10.4018/ijiit.2014010103.

Texte intégral

Résumé :

Frequent Pattern Tree (FP-Tree) is a compact data structure of representing frequent itemsets. The construction of FP-Tree is very important prior to frequent patterns mining. However, there have been too limited efforts specifically focused on constructing FP-Tree data structure beyond from its original database. In typical FP-Tree construction, besides the prior knowledge on support threshold, it also requires two database scans; first to build and sort the frequent patterns and second to build its prefix paths. Thus, twice database scanning is a key and major limitation in completing the co

Styles APA, Harvard, Vancouver, ISO, etc.

6

Yang, Wen Chuan, Bei Jia, and Qing Yi Qu. "Research of an Improved Double-Array Trie Tree Algorithm." Advanced Materials Research 945-949 (June 2014): 2401–4. http://dx.doi.org/10.4028/www.scientific.net/amr.945-949.2401.

Texte intégral

Résumé :

This paper presents an improved algorithm-iDAT, which is based on Double-Array Trie Tree for Chinese Word Segmentation Dictionary. Chinese word segmentation dictionary based on the Double-Array Trie Tree has higher efficiency of search, but the dynamic insertion will consume a lot of time. After initialization the original dictionary. We implement a Hash process to the empty sequence index values for base array. The final Hash table stores the sum of the empty sequence before the current empty sequence. This algorithm adopt Sunday jumps algorithm of Single Pattern Matching. With slightly and r

Styles APA, Harvard, Vancouver, ISO, etc.

7

KATAJAINEN, JYRKI, and ERKKI MÄKINEN. "TREE COMPRESSION AND OPTIMIZATION WITH APPLICATIONS." International Journal of Foundations of Computer Science 01, no. 04 (1990): 425–47. http://dx.doi.org/10.1142/s0129054190000291.

Texte intégral

Résumé :

Different methods for compressing trees are surveyed and developed. Tree compression can be seen as a trade-off problem between time and space in which we can choose different strategies depending on whether we prefer better compression results or more efficient operations in the compressed structure. Of special interest is the case where space can be saved while preserving the functionality of the operations; this is called data optimization. The general compression scheme employed here consists of separate linearization of the tree structure and the data stored in the tree. Also some applica

Styles APA, Harvard, Vancouver, ISO, etc.

8

LIU, Lixia, and Zhiqiang ZHANG. "Similar string search algorithm based on Trie tree." Journal of Computer Applications 33, no. 8 (2013): 2375–78. http://dx.doi.org/10.3724/sp.j.1087.2013.02375.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

9

Akulich, Mikita, Iztok Savnik, Matjaž Krnc, and Riste Škrekovski. "Multiset-Trie Data Structure." Algorithms 16, no. 3 (2023): 170. http://dx.doi.org/10.3390/a16030170.

Texte intégral

Résumé :

This paper proposes a new data structure, multiset-trie, that is designed for storing and efficiently processing a set of multisets. Moreover, multiset-trie can operate on a set of sets without efficiency loss. The multiset-trie structure is a search tree with properties similar to those of a trie. It implements all standard search tree operations together with the multiset containment operations for searching sub-multisets and super-multisets. Suppose that we have a set of multisets S and a multiset X. The multiset containment operations retrieve multisets from S that are either sub-multisets

Styles APA, Harvard, Vancouver, ISO, etc.

10

ALAZEMI, HAMED M. K., and ANTON ČERNÝ. "COUNTING SUBWORDS USING A TRIE AUTOMATON." International Journal of Foundations of Computer Science 22, no. 06 (2011): 1457–69. http://dx.doi.org/10.1142/s0129054111008817.

Texte intégral

Résumé :

We use the concept of trie (prefix tree) representation of a prefix-closed finite language L to design a simple nondeterministic automaton. Each computation of this trie automaton corresponds to a subword occurrence of a word from L in the input word. The matrix representation of the trie automaton leads to a fairly general extension of the original concept of the Parikh matrix from [7].

Styles APA, Harvard, Vancouver, ISO, etc.

Thèses sur le sujet "Trie Tree"

1

King, Stuart. "Optimizations and applications of Trie-Tree based frequent pattern mining." Diss., Connect to online resource - MSU authorized users, 2006.

Trouver le texte intégral

Résumé :

Thesis (M. S.)--Michigan State University. Dept. of Computer Science and Engineering, 2006.<br>Title from PDF t.p. (viewed on June 19, 2009) Includes bibliographical references (p. 79-80). Also issued in print.

Styles APA, Harvard, Vancouver, ISO, etc.

2

Sedlář, František. "Algoritmy pro vyhledání nejdelšího shodného prefixu." Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2013. http://www.nusl.cz/ntk/nusl-236363.

Texte intégral

Résumé :

This master's thesis explains basics of the longest prefix match (LPM) problem. It analyzes and describes chosen LPM algorithms considering their speed, memory requirements and an ability to implement them in hardware. On the basis of former findings it proposes a new algorithm Generic Hash Tree Bitmap. It is much faster than many other approaches, while its memory requirements are even lower. An implementation of the proposed algorithm has become a part of the Netbench library.

Styles APA, Harvard, Vancouver, ISO, etc.

3

Toney, Ethan. "Improving Table Scans for Trie Indexed Databases." UKnowledge, 2018. https://uknowledge.uky.edu/cs_etds/76.

Texte intégral

Résumé :

We consider a class of problems characterized by the need for a string based identifier that reflect the ontology of the application domain. We present rules for string-based identifier schemas that facilitate fast filtering in databases used for this class of problems. We provide runtime analysis of our schema and experimentally compare it with another solution. We also discuss performance in our solution to a game engine. The string-based identifier schema can be used in addition scenarios such as cloud computing. An identifier schema adds metadata about an element. So the solution hinges on

Styles APA, Harvard, Vancouver, ISO, etc.

4

Mallikarjuna, Trishul. "Towards expressive melodic accompaniment using parametric modeling of continuous musical elements in a multi-attribute prediction suffix trie framework." Thesis, Georgia Institute of Technology, 2010. http://hdl.handle.net/1853/37190.

Texte intégral

Résumé :

Elements of continuous variation such as tremolo, vibrato and portamento enable dimensions of their own in expressive melodic music in styles such as in Indian Classical Music. There is published work on parametrically modeling some of these elements individually, and to apply the modeled parameters to automatically generated musical notes in the context of machine musicianship, using simple rule-based mappings. There have also been many systems developed for generative musical accompaniment using probabilistic models of discrete musical elements such as MIDI notes and durations, many of them

Styles APA, Harvard, Vancouver, ISO, etc.

5

Wu, Li. "Distributed true string B-tree peer-to-peer overlay networks." Thesis, University of Ottawa (Canada), 2006. http://hdl.handle.net/10393/27197.

Texte intégral

Résumé :

A fundamental problem that confronts P2P Internet applications is to efficiently locate the physical (IP) node that stores a particular data item. To tackle this application-level routing problem, this thesis proposes a new P2P overlay network, called Distributed True String B-tree (DTSBT) P2P overlay network. Unlike popular Distributed Hash Table (DHT)-based P2P overlay networks which use DHT as their core data structure, the DTSBT P2P overlay network employs a new data structure, DTSBT as its core data structure. A DTSBT is a hybrid distributed data structure, in which all peers' routing tab

Styles APA, Harvard, Vancouver, ISO, etc.

6

Li, Dun. "Optimized blockchain deployment and application for trusted industrial internet of things." Electronic Thesis or Diss., Institut polytechnique de Paris, 2024. http://www.theses.fr/2024IPPAS016.

Texte intégral

Résumé :

L'Internet des objets (IIoT) continue d'offrir de nouvelles perspectives et de nouveaux défis, ainsi que son potentiel pour améliorer son environnement commercial, une cyberattaque, une violation de la vie privée et des probabilités. La chose est la croissance de la technologie. L'avenir de la technologie et de la blockchain est une affaire stable et stable dans le monde des systèmes IIoT. La valeur de la blockchain dans le futur et l'avenir de la bourse. Identité et contrôle d'accès. Malgré ces avantages, mesure que les applications IIoT se diversifient et que les volumes de données croissent

Styles APA, Harvard, Vancouver, ISO, etc.

7

Chesters, Douglas. "Towards the true tree : bioinformatic approaches in the phylogenetics and molecular evolution of the Endopterygota." Thesis, Imperial College London, 2011. http://hdl.handle.net/10044/1/6997.

Texte intégral

Résumé :

In this thesis, I use bioinformatic approaches to address new and existing issues surrounding large-scale phylogenetic analysis. A phylogenetic analysis pipeline is developed to aid an investigation of the suitability of integrating Cytochrome Oxidase Subunit 1 (cox1) into phylogenetic supermatrices. In the first two chapters I assess the effect of varying cox1 sample size within a large variable phylogenetic context. As well as intuitive results on increased quality with greater taxon sampling, there are clear monophyly patters relating to local taxonomic sampling. Specifically, more monophyl

Styles APA, Harvard, Vancouver, ISO, etc.

8

Eckhardt, Bernd Stefan. "Complexity analysis of tries and spanning tree problems." kostenfrei, 2009. https://mediatum2.ub.tum.de/node?id=959271.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

9

Okoth, Isaac Owino. "Combinatorics of oriented trees and tree-like structures." Thesis, Stellenbosch : Stellenbosch University, 2015. http://hdl.handle.net/10019.1/96860.

Texte intégral

Résumé :

Thesis (PhD)--Stellenbosch University, 2015.<br>ENGLISH ABSTRACT : In this thesis, a number of combinatorial objects are enumerated. Du and Yin as well as Shin and Zeng (by a different approach) proved an elegant formula for the number of labelled trees with respect to a given in degree sequence, where each edge is oriented from a vertex of lower label towards a vertex of higher label. We refine their result to also take the number of sources (vertices of in degree 0) or sinks (vertices of out degree 0) into account. We find formulas for the mean and variance of the number of sinks or s

Styles APA, Harvard, Vancouver, ISO, etc.

10

Simmons, Mark Trevor. "Tree-grass and tree-tree interactions in a temperate savanna." Diss., Texas A&M University, 2003. http://hdl.handle.net/1969.1/1168.

Texte intégral

Résumé :

Savannas comprise over one eighth of the world's land surface with some 50 Mha in North America alone. They are productive systems supporting a high level of both faunal and floral diversity and are of increasing socioeconomic importance. The maintenance and formation of savannas have been attributed to climate, soils, herbivory and fire. However, the reasons for the coexistence of trees and the grass layer have still to be determined. These two contrasting life forms create a complex of intra- and interspecific positive, negative, and neutral interactions, few of which have been quantified.

Styles APA, Harvard, Vancouver, ISO, etc.

Livres sur le sujet "Trie Tree"

1

Chardiet, Bernice. Let's trim the tree. Puffin Books, 1994.

Trouver le texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

2

1933-, Thampan Palakasseril Kumaran, and Peekay Tree Crops Development Foundation., eds. Trees and tree farming. Peekay Tree Crops Development Foundation, 1994.

Trouver le texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

3

Ablett, William H. English trees and tree-planting. Smith, Elder, 1986.

Trouver le texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

4

ill, Palen Debbie, ed. Trim the tree for Christmas! Price Stern Sloan, 2000.

Trouver le texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

5

Ablett, William H. English trees and tree-planting. Smith, Elder, 1986.

Trouver le texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

6

Lanin, Vladimir. Tree locking on changing trees. Courant Institute of Mathematical Sciences, New York University, 1990.

Trouver le texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

7

Mikhaĭlovich, Kotelʹnikov Anatoliĭ, ed. Uskorennoe vyrashchivanie drevesnykh porod. Izd-vo "Nauka," Sibirskoe otd-nie, 1987.

Trouver le texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

8

H, Rennenberg, Eschrich Walter, Ziegler H. 1924-, and Deutsche Forschungsgemeinschaft Schwerpunktprogramm, eds. Trees: Contributions to modern tree physiology. Backhuys Publishers, 1997.

Trouver le texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

9

Walter, Eschrich, Rennenberg H, and Ziegler H. 1924-, eds. Trees: Contributions to modern tree physiology. Backhuys Publishers, 1997.

Trouver le texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

10

R, Elevitch Craig, Abbott Isabella Aiona, and Leakey Roger R. B, eds. Traditional trees of Pacific Islands: Their culture, environment, and use. Permanent Agriculture Resources, 2006.

Trouver le texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Chapitres de livres sur le sujet "Trie Tree"

1

Zhou, Xin. "P-Trie Tree: A Novel Tree Structure for Storing Polysemantic Data." In Natural Language Processing and Chinese Computing. Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-25207-0_31.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

2

Abdullah, Zailani, Tutut Herawan, and Mustafa Mat Deris. "Visualizing the Construction of Incremental Disorder Trie Itemset Data Structure (DOSTrieIT) for Frequent Pattern Tree (FP-Tree)." In Lecture Notes in Computer Science. Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-25191-7_18.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

3

Yang, Wenchuan, Jian Liu, and Miao Yu. "Research of an Improved Algorithm for Chinese Word Segmentation Dictionary Based on Double-Array Trie Tree." In Communications in Computer and Information Science. Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-41644-6_33.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

4

Bringmann, Björn, and Albrecht Zimmermann. "Tree 2 – Decision Trees for Tree Structured Data." In Knowledge Discovery in Databases: PKDD 2005. Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11564126_10.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

5

Harris, Brogan J., Paul O. Sheridan, Adrián A. Davín, Cécile Gubry-Rangin, Gergely J. Szöllősi, and Tom A. Williams. "Rooting Species Trees Using Gene Tree-Species Tree Reconciliation." In Methods in Molecular Biology. Springer US, 2022. http://dx.doi.org/10.1007/978-1-0716-2691-7_9.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

6

Niklas, Karl J. "Tree Biomechanics with Special Reference to Tropical Trees." In Tree Physiology. Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-27422-5_19.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

7

Kao, Ming-Yang. "Tree contractions and evolutionary trees." In Lecture Notes in Computer Science. Springer Berlin Heidelberg, 1997. http://dx.doi.org/10.1007/3-540-62592-5_81.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

8

Bille, Philip, Inge Li Gørtz, Gad M. Landau, and Oren Weimann. "Tree Compression with Top Trees." In Automata, Languages, and Programming. Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-39206-1_14.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

9

Kartzow, Alexander, Jiamou Liu, and Markus Lohrey. "Tree-Automatic Well-Founded Trees." In Lecture Notes in Computer Science. Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-30870-3_37.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

10

Fineschi, Silvia, Francesco Loreto, Michael Staudt, and Josep Peñuelas. "Diversification of Volatile Isoprenoid Emissions from Trees: Evolutionary and Ecological Perspectives." In Tree Physiology. Springer Netherlands, 2013. http://dx.doi.org/10.1007/978-94-007-6606-8_1.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Actes de conférences sur le sujet "Trie Tree"

1

Rupsys, Petras. "STOCHASTIC SIMULATION OF SELF-THINNING." In 24th SGEM International Multidisciplinary Scientific GeoConference 2024. STEF92 Technology, 2024. https://doi.org/10.5593/sgem2024/3.1/s14.46.

Texte intégral

Résumé :

Understanding the principles of self-thinning forest ecosystems is essential for taking modern management techniques into practice. The spatial distribution of the surviving trees in a stand is influenced by a variety of factors, including tree mortality. In young forests, competition has a major role in determining spatial mortality; in older forests, random changes in the environment have a major role. The dynamics of the number of living and dead trees in the forests of central Lithuania will be addressed in this study. The Gompertz type mixed effect parameters univariate stochastic differe

Styles APA, Harvard, Vancouver, ISO, etc.

2

Sisenis, Linards, Irina Pilvere, Baiba Jansone, Dace Brizga, and Edgars Dubrovskis. "ASSESSMENT OF THE QUALITY AND PRODUCTIVITY OF LODGEPOLE PINE GROWN IN THE WESTERN PART OF LATVIA." In 24th SGEM International Multidisciplinary Scientific GeoConference 2024. STEF92 Technology, 2024. https://doi.org/10.5593/sgem2024/3.1/s14.42.

Texte intégral

Résumé :

The research aims to examine the pace of growth of lodgepole pine, the amount of damage caused by biungulates and the quality of trunks for lodgepole pine provenances growing in the western part of Latvia in the areas around Ugale and Kuldiga, identifying the most damage-resistant and promising provenances for cultivation in Latvia. In Latvia, foresters and plant breeders have been working for years to increase the quality and productivity of local tree species, while assessing various forest stand management patterns and trying to reduce the rotation period of stands. Nowadays, because of cli

Styles APA, Harvard, Vancouver, ISO, etc.

3

Miezit, Olga, Edgars Dubrovskis, Dace Brizga, and Aija Berzina. "NATURAL REGENERATION OF PINUS SYLVESTRIS L. FROM SEED TREES IN POOR MINERAL SOILS." In 24th SGEM International Multidisciplinary Scientific GeoConference 2024. STEF92 Technology, 2024. https://doi.org/10.5593/sgem2024/3.1/s14.45.

Texte intégral

Résumé :

In economic forests, the productivity of forest stands should be increased as much as possible, because the global demand for timber is growing every year. Planted forest trees can be realized using the advantages of selection, naturally regenerated - faster growth can be achieved by improving the growing conditions and limiting factors that reduce or delay the formation of growth. Data were collected in 6-year-old P.sylvestris forest stands Cladinoso-callunosa and Vacciniosa. The plots were established in an area of 17.2 ha (R=7.98 m; S=200 m2), each with a seed tree in the center. The aim of

Styles APA, Harvard, Vancouver, ISO, etc.

4

Jiang, Yi, and Fengjun Shang. "Research on Multibit-Trie Tree IP Classification Algorithm." In 2006 International Conference on Communications, Circuits and Systems. IEEE, 2006. http://dx.doi.org/10.1109/icccas.2006.285020.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

5

Haoliang, Sun, and Wang Dawei. "Multi-step Trie Tree Packet Classification Method supporting Wildcards." In 2019 IEEE 3rd Advanced Information Management, Communicates, Electronic and Automation Control Conference (IMCEC). IEEE, 2019. http://dx.doi.org/10.1109/imcec46724.2019.8984152.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

6

Li, Bin, Wanying Dong, and Qinglei Zhou. "Trie Tree Probabilistic Password Cracking Method Based on FPGA." In CSAE 2020: The 4th International Conference on Computer Science and Application Engineering. ACM, 2020. http://dx.doi.org/10.1145/3424978.3425021.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

7

Xiaofan Zhang and Yujun Fan. "A reduction algorithm based on trie tree of inconsistent system." In 2011 2nd International Conference on Artificial Intelligence, Management Science and Electronic Commerce (AIMSEC). IEEE, 2011. http://dx.doi.org/10.1109/aimsec.2011.6011475.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

8

Xu, Yongbing, and Junyi Wang. "The Adaptive Spelling Error Checking Algorithm based on Trie Tree." In 2016 2nd International Conference on Advances in Energy, Environment and Chemical Engineering (AEECE 2016). Atlantis Press, 2016. http://dx.doi.org/10.2991/aeece-16.2016.62.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

9

Wang, Yuanshuai, Zhanfang Chen, Kexin Wang, and Zhangnan Yang. "Education Cloud Data Integrity Verification Based on Mapping-Trie Tree." In 2019 International Conference on Machine Learning, Big Data and Business Intelligence (MLBDBI). IEEE, 2019. http://dx.doi.org/10.1109/mlbdbi48998.2019.00036.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

10

Yang, Wenchuan, Zeyang Fang, and Lei Hui. "Study of an Improved Text Filter Algorithm Based on Trie Tree." In 2016 International Symposium on Computer, Consumer and Control (IS3C). IEEE, 2016. http://dx.doi.org/10.1109/is3c.2016.153.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Rapports d'organisations sur le sujet "Trie Tree"

1

Duguma, Lalisa, Peter Minang, Ermias Aynekulu, et al. From Tree Planting to Tree Growing: Rethinking Ecosystem Restoration Through Trees. World Agroforestry Centre, 2020. http://dx.doi.org/10.5716/wp20001.pdf.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

2

Swanson, David. Tree investigations in the Noatak National Preserve, Alaska, 2011?2022: Old-growth and new forests. National Park Service, 2023. http://dx.doi.org/10.36967/2301700.

Texte intégral

Résumé :

Tree rings in the Noatak National Preserve provide information about the growth of trees at the cold limit of tree survival in northwestern North America. The present study was based on cores and other tree measurements (tree basal area, height, and number per unit area) of white spruce (Picea glauca) and balsam poplar (Populus balsamifera) trees taken from 39 permanent monitoring plots (34 with coreable trees) at three locations in the Preserve. The tree rings widths were measured and then normalized using a 50-year smoothing spline to remove the effects of growth variations through the life

Styles APA, Harvard, Vancouver, ISO, etc.

3

Mahoney, James. Tree Graphs and Orthogonal Spanning Tree Decompositions. Portland State University Library, 2000. http://dx.doi.org/10.15760/etd.2939.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

4

van Doorn, Natalie S., Lara A. Roman, E. Gregory McPherson, et al. Urban tree monitoring. U.S. Department of Agriculture, Forest Service, Pacific Southwest Research Station, 2020. http://dx.doi.org/10.2737/psw-gtr-266.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

5

Roman, Lara A., Natalie S. van Doorn, E. Gregory McPherson, et al. Urban tree monitoring. U.S. Department of Agriculture, Forest Service, Northern Research Station, 2020. http://dx.doi.org/10.2737/nrs-gtr-194.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

6

Nowak, David J. Understanding i-Tree. U.S. Department of Agriculture, Forest Service, Northern Research Station, 2020. http://dx.doi.org/10.2737/nrs-gtr-200.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

7

Bjorklund, M. YANG Tree Diagrams. Edited by L. Berger. RFC Editor, 2018. http://dx.doi.org/10.17487/rfc8340.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

8

Nowak, David J. Understanding i-Tree. U.S. Department of Agriculture, Forest Service, Northern Research Station, 2021. http://dx.doi.org/10.2737/nrs-gtr-200-2021.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

9

Klobucar, Blaz. Urban Tree Detection in Historical Aerial Imagery of Sweden : a test in automated detection with open source Deep Learning models. Faculty of Landscape Architecture, Horticulture and Crop Production Science, Swedish University of Agricultural Sciences, 2024. http://dx.doi.org/10.54612/a.7kn4q7vikr.

Texte intégral

Résumé :

Urban trees are a key component of the urban environment. In Sweden, ambitious goals have been expressed by authorities regarding the retention and increase of urban tree cover, aiming to mitigate climate change and provide a healthy, livable urban environment in a highly contested space. Tracking urban tree cover through remote sensing serves as an indicator of how past urban planning has succeeded in retaining trees as part of the urban fabric, and historical imagery spanning back decades for such analysis is widely available. This short study examines the viability of automated detection us

Styles APA, Harvard, Vancouver, ISO, etc.

10

Shannon, Danielle, Ryan Toot, Annamarie Rutledge, Patricia R. Butler, and Madeline Baroli. Considering climate change in tree planting. U.S. Department of Agriculture, Northern Forests Climate,, 2023. http://dx.doi.org/10.32747/2023.8054015.ch.

Texte intégral

Résumé :

This guide provides a step-by-step process to help you consider climate change when selecting a tree for planting at a site and provides a framework to help learn about the projected habitat suitability of trees in your area under climate change. This guide includes a checklist and worksheets that can help you evaluate if the tree you want to plant can tolerate the growing conditions of your site and the additional risks brought about by climate change. The worksheets in this guide will help you to briefly summarize key characteristics of your site and then evaluate whether the tree species pl

Styles APA, Harvard, Vancouver, ISO, etc.

Nous offrons des réductions sur tous les plans premium pour les auteurs dont les œuvres sont incluses dans des sélections littéraires thématiques. Contactez-nous pour obtenir un code promo unique!