Bibliografías temáticas / Tree

Índice

Artículos de revistas
Tesis
Libros
Capítulos de libros
Actas de conferencias
Informes

Literatura académica sobre el tema "Tree"

Autor: Grafiati

Publicado: 4 de junio de 2021

Última modificación: 29 de julio de 2024

Crea una cita precisa en los estilos APA, MLA, Chicago, Harvard y otros

Elija tipo de fuente:

Consulte las listas temáticas de artículos, libros, tesis, actas de conferencias y otras fuentes académicas sobre el tema "Tree".

Junto a cada fuente en la lista de referencias hay un botón "Agregar a la bibliografía". Pulsa este botón, y generaremos automáticamente la referencia bibliográfica para la obra elegida en el estilo de cita que necesites: APA, MLA, Harvard, Vancouver, Chicago, etc.

También puede descargar el texto completo de la publicación académica en formato pdf y leer en línea su resumen siempre que esté disponible en los metadatos.

Artículos de revistas sobre el tema "Tree"

Kim, Ju-Chul y Sang-Joong Lee. "A Lecture Note for Introduction of Steiner (Fermat) Tree to Electrical Engineering Education - Comparison of Path Lengths of Minimum Spanning Tree and Steiner Tree". Journal of the Korean Institute of Illuminating and Electrical Installation Engineers 33, n.º 6 (30 de junio de 2019): 9–18. http://dx.doi.org/10.5207/jieie.2019.33.6.009.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

Schaar, Günter y Zdzisław Skupień. "Pairs of trees in tree–tree triangulations". Discrete Mathematics 307, n.º 11-12 (mayo de 2007): 1499–505. http://dx.doi.org/10.1016/j.disc.2005.11.087.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

Jasmine, Jasmine, Pankaj Bhambri y Dr O. P. Gupta Dr. O.P. Gupta. "Analyzing the Phylogenetic Trees with Tree- building Methods". Indian Journal of Applied Research 1, n.º 7 (1 de octubre de 2011): 83–85. http://dx.doi.org/10.15373/2249555x/apr2012/25.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

Williams, Roger A. "Use of Randomized Branch and Importance Sampling to Estimate Loblolly Pine Biomass". Southern Journal of Applied Forestry 13, n.º 4 (1 de noviembre de 1989): 181–84. http://dx.doi.org/10.1093/sjaf/13.4.181.

Texto completo

Resumen

Abstract A previously developed sampling method utilizing randomized branch and importance sampling for the purpose of quickly estimating tree biomass was tested on five loblolly pine (Pinus taeda L.) trees. Results show a wide range of per-tree sampling error, ranging from 5.3 to 28.9%. Largevariation in foliage content among selected branches per treee may be a major source of error. However, the sampling error for the total biomass of the five trees tested was only 3.3%. This sampling method appears to be reliable and efficient in obtaining precise estimates of the total biomassof a population of trees. Increased sampling intensity per tree is necessary to obtain precise estimates of individual tree biomass. South. J. Appl. For. 13(4):181-184.

Los estilos APA, Harvard, Vancouver, ISO, etc.

Freilicher, Mollie. "Tree by Tree, Yard by Yard: Replanting Worcester's Trees". Arnoldia 69, n.º 1 (2011): 2–13. http://dx.doi.org/10.5962/p.258693.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

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

Texto completo

Resumen

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 occurrences. We also study the deterministic top-down state complexity of path-closed languages for the same problem.

Los estilos APA, Harvard, Vancouver, ISO, etc.

Carmesin, Johannes, Matthias Hamann y Babak Miraftab. "Canonical trees of tree-decompositions". Journal of Combinatorial Theory, Series B 152 (enero de 2022): 1–26. http://dx.doi.org/10.1016/j.jctb.2021.08.004.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

Kao, Ming-Yang. "Tree Contractions and Evolutionary Trees". SIAM Journal on Computing 27, n.º 6 (diciembre de 1998): 1592–616. http://dx.doi.org/10.1137/s0097539795283504.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

Bille, Philip, Inge Li Gørtz, Gad M. Landau y Oren Weimann. "Tree compression with top trees". Information and Computation 243 (agosto de 2015): 166–77. http://dx.doi.org/10.1016/j.ic.2014.12.012.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

Margot, F., A. Prodon y Th M. Liebling. "Tree polytope on 2-trees". Mathematical Programming 63, n.º 1-3 (enero de 1994): 183–91. http://dx.doi.org/10.1007/bf01582065.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

Más fuentes

Tesis sobre el tema "Tree"

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.

Texto completo

Resumen

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. Under lower-than-average rainfall, tree effects on grasses in a Prosopis savanna in northern Texas were largely neutral with few measurable competitive or facultative effects from the tree canopy. However, grasses demonstrated increased productivity where belowground competition with neighboring trees was removed. Similarly, tree growth increased following the removal of grasses under and around individual trees, particularly on shallower soils, but only during a season of significant precipitation. Low intensity burning of grasses enhanced growth of adult trees, but patterns were inconsistent between two different sites. Moderate clipping around individual trees had no apparent effect on tree growth. Intraspecific competition between savanna trees was not evident, but may have been blurred by an extensive, lateral distribution of near-surface roots. Overall, tree intraspecific competition was neutral regardless of soil depth, suggesting lateral tree roots may be only used opportunistically. Although some competitive relationships were verified, the differences in the responses between the two years of study, and at different sites indicated that soil depth and climate may have overriding impacts on tree-grass interactions and savanna dynamics in this system.

Los estilos APA, Harvard, Vancouver, ISO, etc.

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

Texto completo

Resumen

Thesis (PhD)--Stellenbosch University, 2015.
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 sources in these trees. We also obtain a differential equation and a functional equation satisfied by the generating function for these trees. Analogous results for labelled trees with two marked vertices, related to functional digraphs, are also established. We extend the work to count reachable vertices, sinks and leaf sinks in these trees. Among other results, we obtain a counting formula for the number of labelled trees on n vertices in which exactly k vertices are reachable from a given vertex v and also the average number of vertices that are reachable from a specified vertex in labelled trees of order n. In this dissertation, we also enumerate certain families of set partitions and related tree-like structures. We provide a proof for a formula that counts connected cycle-free families of k set partitions of {1, . . . , n} satisfying a certain coherence condition and then establish a bijection between these families and the set of labelled free k-ary cacti with a given vertex-degree distribution. We then show that the formula also counts coloured Husimi graphs in which there are no blocks of the same colour that are incident to one another. We extend the work to count coloured oriented cacti and coloured cacti. Noncrossing trees and related tree-like structures are also considered in this thesis. Specifically, we establish formulas for locally oriented noncrossing trees with a given number of sources and sinks, and also with given indegree and outdegree sequences. The work is extended to obtain the average number of reachable vertices in these trees. We then generalise the concept of noncrossing trees to find formulas for the number of noncrossing Husimi graphs, cacti and oriented cacti. The study is further extended to find formulas for the number of bicoloured noncrossing Husimi graphs and the number of noncrossing connected cycle-free pairs of set partitions.
AFRIKAANSE OPSOMMING : In hierdie tesis word ’n aantal kombinatoriese objekte geenumereer. Du en Yin asook Shin en Zeng (deur middel van ’n ander benadering) het ’n elegante formule vir die aantal geëtiketteerde bome met betrekking tot ’n gegewe ingangsgraadry, waar elke lyn van die nodus met die kleiner etiket na die nodus met die groter etiket toe georiënteer word. Ons verfyn hul resultaat deur ook die aantal bronne (nodusse met ingangsgraad 0) en putte (nodusse met uitgangsgraad 0) in ag te neem. Ons vind formules vir die gemiddelde en variansie van die aantal putte of bronne in hierdie bome. Ons bepaal verder ’n differensiaalvergelyking en ’n funksionaalvergelyking wat deur die voortbringende funksie van hierdie bome bevredig word. Analoë resultate vir geëtiketteerde bome met twee gemerkte nodusse (wat verwant is aan funksionele digrafieke), is ook gevind. Ons gaan verder voort deur ook bereikbare nodusse, bronne en putte in hierdie bome at te tel. Onder andere verkry ons ’n formule vir die aantal geëtiketteerde bome met n nodusse waarin presies k nodusse vanaf ’n gegewe nodus v bereikbaar is asook die gemiddelde aantal nodusse wat bereikbaar is vanaf ’n gegewe nodus. Ons enumereer in hierdie tesis verder sekere families van versamelingsverdelings en soortgelyke boom-vormige strukture. Ons gee ’n bewys vir ’n formule wat die aantal van samehangende siklus-vrye families van k versamelingsverdelings op {1, . . . , n} wat ’n sekere koherensie-vereiste bevredig, en ons beskryf ’n bijeksie tussen hierdie familie en die versameling van geëtiketteerde vrye k-êre kaktusse met ’n gegewe nodus-graad-verdeling. Ons toon ook dat hierdie formule ook gekleurde Husimi-grafieke tel waar blokke van dieselfde kleur nie insident met mekaar mag wees nie. Ons tel verder ook gekleurde georiënteerde kaktusse en gekleurde kaktusse. Nie-kruisende bome en soortgelyke boom-vormige strukture word in hierdie tesis ook beskou. On bepaal spesifiek formules vir lokaal georiënteerde nie-kruisende bome wat ’n gegewe aantal bronne en putte het asook nie-kruisende bome met gegewe ingangs- en uitgangsgraadrye. Ons gaan voort deur die gemiddelde aantal bereikbare nodusse in hierdie bome te bepaal. Ons veralgemeen dan die konsep van nie-kruisende bome en vind formules vir die aantal nie-kruisende Husimi-grafieke, kaktusse en georiënteerde kaktusse. Laastens vind ons ’n formule vir die aantaal tweegekleurde nie-kruisende Husimi-grafieke en die aantal nie-kruisende samehangende siklus-vrye pare van versamelingsverdelings.

Los estilos APA, Harvard, Vancouver, ISO, etc.

Creus, López Carles. "Tree automata with constraints and tree homomorphisms". Doctoral thesis, Universitat Politècnica de Catalunya, 2016. http://hdl.handle.net/10803/394077.

Texto completo

Resumen

Automata are a widely used formalism in computer science as a concise representation for sets. They are interesting from a theoretical and practical point of view. This work is focused on automata that are executed on tree-like structures, and thus, define sets of trees. Moreover, we tackle automata that are enhanced with the possibility to check (dis)equality constraints, i.e., where the automata are able to test whether specific subtrees of the input tree are equal or different. Two distinct mechanisms are considered for defining which subtrees have to be compared in the evaluation of the constraints. First, in local constraints, a transition of the automaton compares subtrees pending at positions relative to the position of the input tree where the transition takes place. Second, in global constraints, the subtrees tested are selected depending on the state to which they are evaluated by the automaton during a computation. In the setting of local constraints, we introduce tree automata with height constraints between brothers. These constraints are predicates on sibling subtrees that, instead of evaluating whether the subtrees are equal or different, compare their respective heights. Such constraints allow to express natural tree sets like complete or balanced (like AVL) trees. We prove decidability of emptiness and finiteness for these automata, and also for their combination with the tree automata with (dis)equality constraints between brothers of Bogaert and Tison (1992). We also define a new class of tree automata with constraints that allows arbitrary local disequality constraints and a particular kind of local equality constraints. We prove decidability of emptiness and finiteness for this class in exponential time. As a consequence, we obtain several EXPTIME-completeness results for problems on images of regular tree sets under tree homomorphisms, like set inclusion, finiteness of set difference, and regularity (also called HOM problem). In the setting of global constraints, we study the class of tree automata with global reflexive disequality constraints. Such kind of constraints is incomparable with the original notion of global disequality constraints of Filiot et al. (2007): the latter restricts disequality tests to only compare subtrees evaluated to distinct states, whereas in our model it is possible to test that all subtrees evaluated to the same given state are pairwise different. Our tests correspond to monadic key constraints, and thus, can be used to characterize unique identifiers, a typical integrity constraint of XML schemas. We study the emptiness and finiteness problems for these automata, and obtain decision algorithms that take triple exponential time.
Los autómatas son un formalismo ampliamente usado en ciencias de la computación como una representación concisa para conjuntos, siendo interesantes tanto a nivel teórico como práctico. Este trabajo se centra en autómatas que se ejecutan en estructuras arbóreas, y por tanto, definen conjuntos de árboles. En particular, tratamos autómatas que han sido extendidos con la posibilidad de comprobar restricciones de (des)igualdad, es decir, autómatas que son capaces de comprobar si ciertos subárboles del árbol de entrada son iguales o diferentes. Se consideran dos mecanismos distintos para definir qué subárboles deben ser comparados en la evaluación de las restricciones. Primero, en las restricciones locales, una transición del autómata compara subárboles que penden en posiciones relativas a la posición del árbol de entrada en que se aplica la transición. Segundo, en restricciones globales, los subárboles comparados se seleccionan dependiendo del estado al que son evaluados por el autómata durante el cómputo. En el marco de restricciones locales, introducimos los autómatas de árboles con restricciones de altura entre hermanos. Estas restricciones son predicados entre subárboles hermanos que, en lugar de evaluar si los subárboles son iguales o diferentes, comparan sus respectivas alturas. Este tipo de restricciones permiten expresar conjuntos naturales de árboles, tales como árboles completos o equilibrados (como AVL). Demostramos la decidibilidad de la vacuidad y finitud para este tipo de autómata, y también para su combinación con los autómata con restricciones de (des)igualdad entre hermanos de Bogaert y Tison (1992). También definimos una nueva clase de autómatas con restricciones que permite restricciones locales de desigualdad arbitrarias y un tipo particular de restricciones locales de igualdad. Demostramos la decidibilidad de la vacuidad y finitud para esta clase, con un algoritmo de tiempo exponencial. Como consecuencia, obtenemos varios resultados de EXPTIME-completitud para problemas en imágenes de conjuntos regulares de árboles a través de homomorfismos de árboles, tales como inclusión de conjuntos, finitud de diferencia de conjuntos, y regularidad (también conocido como el problema HOM). En el marco de restricciones globales, estudiamos la clase de autómatas de árboles con restricciones globales de desigualdad reflexiva. Este tipo de restricciones es incomparable con la noción original de restricciones globales de desigualdad de Filiot et al. (2007): éstas últimas restringen las comprobaciones de desigualdad a subárboles que se evalúen a estados distintos, mientras que en nuestro modelo es posible comprobar que todos los subárboles que se evalúen a un mismo estado dado son dos a dos distintos. Nuestras restricciones corresponden a restricciones de clave, y por tanto, pueden ser usadas para caracterizar identificadores únicos, una restricción de integridad típica de los XML Schemas. Estudiamos los problemas de vacuidad y finitud para estos autómatas, y obtenemos algoritmos de decisión con coste temporal triplemente exponencial.

Los estilos APA, Harvard, Vancouver, ISO, etc.

Mahoney, James Raymond. "Tree Graphs and Orthogonal Spanning Tree Decompositions". PDXScholar, 2016. http://pdxscholar.library.pdx.edu/open_access_etds/2944.

Texto completo

Resumen

Given a graph G, we construct T(G), called the tree graph of G. The vertices of T(G) are the spanning trees of G, with edges between vertices when their respective spanning trees differ only by a single edge. In this paper we detail many new results concerning tree graphs, involving topics such as clique decomposition, planarity, and automorphism groups. We also investigate and present a number of new results on orthogonal tree decompositions of complete graphs.

Los estilos APA, Harvard, Vancouver, ISO, etc.

McCarthy, Meghan E. "THE LEMON TREE: MY TREE OF LIFE". CSUSB ScholarWorks, 2014. https://scholarworks.lib.csusb.edu/etd/49.

Texto completo

Resumen

The Lemon Tree is a collection of poems that arose from my attempt to capture memories of influential experiences in growing up. The poems are written in prose blocks and move in and out of childlike and adult sensibilities, creating the disillusion of time and memory. The poems themselves are comments on the unreliability and limited scope of memory and compare remembrance to dreams. This suggests that time moves more fluidly than the waking world accepts. Through looking back, through prisms, the speaker remembers experiences that impacted her development as we follow her on a journey to coming-of-age. The Lemon Tree grapples with becoming and expressing her female fertility and growth as a woman. The speaker constantly searches for love in places of religion, marriage, romantic relationships and friendships. At times, the poems decide what love is by what it isn’t. The act of creating itself was the aim of the manuscript more than the finished project. Some remembrances are intentionally left unclear and messy like wild weeds. The poems are confessional and bear resemblances to a memoir in a lyrical fashion. The Lemon Tree focuses on the processes of life: both the barren and the abundance of fruit, light and dark, winter and summer. The speaker tries to resolve the binaries of trauma and of love and in the process, finds her identity as seen through the symbol of The Lemon Tree, which ultimately becomes her personal tree of life.

Los estilos APA, Harvard, Vancouver, ISO, etc.

Abu-Ata, Muad Mustafa. "Tree-Like Structure in Graphs and Embedability to Trees". Kent State University / OhioLINK, 2014. http://rave.ohiolink.edu/etdc/view?acc_num=kent1397345185.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

Lieberman, Michael (Michael R. ). "Combining phrase-based and tree-to-tree translation". Thesis, Massachusetts Institute of Technology, 2008. http://hdl.handle.net/1721.1/45635.

Texto completo

Resumen

Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2008.
This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.
Includes bibliographical references (p. 39-40).
We present a novel approach to multi-engine machine translation, using a feature-based classification algorithm. Instead of just using language models, translation models, or internal confidence scores, we sought out other features that could be used to determine which of two translations to select. We combined the outputs from a phrase-based system, Moses [Koehn et al., 2007] and a tree-to-tree system [Cowan et al., 2006]. Our main result is a 0.3 to 0.4 improvement in BLEU score over the best single system used, while also improving fluency and adequacy judgments. In addition, we used the same setup to directly predict which sentences would be judged by humans to be more fluent and more adequate. In those domains, we predicted the better sentence 6% to 7% more often than a baseline of always choosing the single best system.
by Michael Lieberman.
M.Eng.

Los estilos APA, Harvard, Vancouver, ISO, etc.

Götze, Doreen. "Weighted Unranked Tree Automata over Tree Valuation Monoids". Doctoral thesis, Universitätsbibliothek Leipzig, 2017. http://nbn-resolving.de/urn:nbn:de:bsz:15-qucosa-221154.

Texto completo

Resumen

Quantitative aspects of systems, like the maximal consumption of resources, can be modeled by weighted automata. The usual approach is to weight transitions with elements of a semiring and to define the behavior of the weighted automaton by mul- tiplying the transition weights along a run. In this thesis, we define and investigate a new class of weighted automata over unranked trees which are defined over valuation monoids. By turning to valuation monoids we use a more general cost model: the weight of a run is now determined by a global valuation function. Besides the binary cost functions implementable via semirings, valuation functions enable us to cope with average and discounting. We first investigate the supports of weighted unranked tree automata over valuation monoids, i.e., the languages of all words which are evalu- ated to a non-zero value. We will furthermore consider the support of several other weighted automata models over different structures, like words and ranked trees. Next we prove a Nivat-like theorem for the new weighted unranked tree automata. More- over, we give a logical characterization for them. We show that weighted unranked tree automata are expressively equivalent to a weighted MSO logic for unranked trees. This solves an open problem posed by Droste and Vogler. Finally, we present a Kleene- type result for weighted ranked tree automata over valuation monoids.

Los estilos APA, Harvard, Vancouver, ISO, etc.

Cha, Kyoung-Choul. "Dream tree /". Online version of thesis, 1995. http://hdl.handle.net/1850/12139.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

Collier, Samantha Noelle. "Silo tree". Thesis, University of Iowa, 2015. https://ir.uiowa.edu/etd/1573.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

Más fuentes

Libros sobre el tema "Tree"

1933-, Thampan Palakasseril Kumaran y Peekay Tree Crops Development Foundation., eds. Trees and tree farming. Cochin, Kerala, India: Peekay Tree Crops Development Foundation, 1994.

Buscar texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

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

Buscar texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

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

Buscar texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

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

Buscar texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

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

Buscar texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

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

Buscar texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

José, F. Sionil. Tree. 3^a ed. Manila: Solidaridad Pub. House, 1988.

Buscar texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

Burnie, David. Tree. New York: Knopf, 1988.

Buscar texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

Burnie, David. Tree. London: DK, 2005.

Buscar texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

Burnie, David. Tree. London: DK, 2005.

Buscar texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

Más fuentes

Capítulos de libros sobre el tema "Tree"

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

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

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

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

Weik, Martin H. "tree". En Computer Science and Communications Dictionary, 1836. Boston, MA: Springer US, 2000. http://dx.doi.org/10.1007/1-4020-0613-6_20117.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

Izadkhah, Habib. "Tree". En Problems on Algorithms, 231–67. Cham: Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-031-17043-0_7.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

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

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

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

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

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

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

Maneth, Sebastian y Giorgio Busatto. "Tree Transducers and Tree Compressions". En Lecture Notes in Computer Science, 363–77. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-24727-2_26.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

Benedikt, Michael y Christoph Koch. "Interpreting Tree-to-Tree Queries". En Automata, Languages and Programming, 552–64. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11787006_47.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

Anstey, Matthew. "Tree tigers and tree elephants". En Structural-Functional Studies in English Grammar, 227–56. Amsterdam: John Benjamins Publishing Company, 2007. http://dx.doi.org/10.1075/slcs.83.14ans.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

Actas de conferencias sobre el tema "Tree"

Chen, Li, Rupesh Choubey y Elke A. Rundensteiner. "Bulk-insertions info r-trees using the small-tree-large-tree approach". En the sixth ACM international symposium. New York, New York, USA: ACM Press, 1998. http://dx.doi.org/10.1145/288692.288722.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

Boitet, Ch y Y. Zaharin. "Representation trees and string-tree correspondences". En the 12th conference. Morristown, NJ, USA: Association for Computational Linguistics, 1988. http://dx.doi.org/10.3115/991635.991648.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

Popovas, Darius, Valentas Mikalauskas, Dominykas Šlikas, Simonas Valotka y Tautvydas Šorys. "Individual Tree Parameters Estimation from Terrestrial Laser Scanner Data". En Environmental Engineering. VGTU Technika, 2017. http://dx.doi.org/10.3846/enviro.2017.230.

Texto completo

Resumen

Tree models and information on the various characteristics of trees and forests are required for forest management, city models, carbon accounting and the management of assets. In order to get precise characteristics and information, tree modelling must be done at individual tree level as it represents the interaction process between trees. For sustainable forest management, more information is needed, however, the traditional methods of investigating forest parameters such as, tree height, diameter at breast height, crown diameter, stem curve and stem mapping or tree location are complex and labour-intensive. Light detection and ranging (LiDAR) has been proposed as a suitable technique for mapping of forest biomass. LiDAR can be operated in airborne configuration (Airborne laser scanning) or in a terrestrial setup. Terrestrial Laser Scanner measures forests from below canopy and offers a much more detailed description of the individual trees. The aim of this study is to derive the essential tree parameters for estimation of biomass from terrestrial LiDAR data. Tree height, diameter at breast height, crown diameter, stem curve and tree locations were extracted from Terrestrial Laser Scanner point clouds.

Los estilos APA, Harvard, Vancouver, ISO, etc.

Sampaio, Valzeli. "Wish Mango Tree: hybrid experimentation and creation". En LINK 2021. Tuwhera Open Access, 2021. http://dx.doi.org/10.24135/link2021.v2i1.109.

Texto completo

Resumen

This essay presents the process of creating the artistic project at augmented reality “Wish Mango Tree” is configured as a specific site / public intervention for installing in the georeferenced mango trees of the city of Belém a technological device for electronic labeling and the creation of a hollow steel plate at mango tree. This process involves experimentation and creation related to Visual Arts, Design and programming, experienced through a mobile application, being a physical hybrid intervention. “Wish Mango Tree” is inspired by the work “Wish Tree” , a series of art installations in process, started in 1981, by the Japanese artist, and member of the Fluxus group, Yoko Ono. She chooses a tree native to a place, or plants one under her guidance. The public is invited to tie a wish in writing and hang it on the tree. Yoko has already installed this work in some cities in the world. “Wish Mango Tree” proposes an action similar to the public and passers-by of the mango trees in Belém. The project promotes interaction between individuals: humans and mango trees. Digital content can be viewed in the augmented reality app at the site specific where mango leaf wishes can be accessed by anyone. “Mangueira Desejo” seeks to fill a gap or lack identified: the invisibility of mango trees, seeking to use technology to give visibility to a social and ecological problem. The political dimension of the project is revealed in giving visibility to the mango trees, activating the collective memory and provoking questions and commitments from the individuals involved: trees, people, and institutions. This artistic project aimed at experimentation and creation related to Visual Arts and Design, experienced through a mobile application. And evokes the affective memory of its participants, seeking to enhance, strengthen and maintain the identity and cultural memory of Pará through digital media. The project fits into the artistic and cultural area: Visual Arts, with the creation of proposals in the Visual Arts area, through the areas: installation, intervention mechanisms, specific site, urban art, digital art, new media, photography , being a hybrid proposal between art and digital design. In addition to addressing the experience of the visual arts in their technical, formal and conceptual reflections, of creation, diffusion, training and memory. In this sense, the project promotes creation, experimentation and design associated with a historical, social, cultural, sustainable and / or technological context, which can be translated into propositional actions that address graphic design, interactive media, web design/applications, design of games. The mango trees themselves are objects of public interest, the app invites everyone to “hang” their desires on the “Wish Mango Trees ”, promoting the transformation of the mango trees into a receptacle for the aspirations of the people who cross it. The app will promote remotely a network experience that triggers a physical experience in the main mango trees of the square, when approaching a mango tree to start the action, which will give visibility to the cloud of annotations at mango leaves through mobile app.

Los estilos APA, Harvard, Vancouver, ISO, etc.

Hudzia, Benoit, M.-Tahar Kechadi y Adrian Ottewill. "TreeP: A Tree Based P2P Network Architecture". En 2005 IEEE International Conference on Cluster Computing. IEEE, 2005. http://dx.doi.org/10.1109/clustr.2005.347022.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

"CONSOLIDATED TREE CONSTRUCTION ALGORITHM: STRUCTURALLY STEADY TREES". En 6th International Conference on Enterprise Information Systems. SciTePress - Science and and Technology Publications, 2004. http://dx.doi.org/10.5220/0002602200140021.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

Vos, Daniël y Sicco Verwer. "Optimal Decision Tree Policies for Markov Decision Processes". En Thirty-Second International Joint Conference on Artificial Intelligence {IJCAI-23}. California: International Joint Conferences on Artificial Intelligence Organization, 2023. http://dx.doi.org/10.24963/ijcai.2023/606.

Texto completo

Resumen

Interpretability of reinforcement learning policies is essential for many real-world tasks but learning such interpretable policies is a hard problem. Particularly, rule-based policies such as decision trees and rules lists are difficult to optimize due to their non-differentiability. While existing techniques can learn verifiable decision tree policies, there is no guarantee that the learners generate a policy that performs optimally. In this work, we study the optimization of size-limited decision trees for Markov Decision Processes (MPDs) and propose OMDTs: Optimal MDP Decision Trees. Given a user-defined size limit and MDP formulation, OMDT directly maximizes the expected discounted return for the decision tree using Mixed-Integer Linear Programming. By training optimal tree policies for different MDPs we empirically study the optimality gap for existing imitation learning techniques and find that they perform sub-optimally. We show that this is due to an inherent shortcoming of imitation learning, namely that complex policies cannot be represented using size-limited trees. In such cases, it is better to directly optimize the tree for expected return. While there is generally a trade-off between the performance and interpretability of machine learning models, we find that on small MDPs, depth 3 OMDTs often perform close to optimally.

Los estilos APA, Harvard, Vancouver, ISO, etc.

Cohen, Jaime, Luiz A. Rodrigues y Elias P. Duarte Jr. "Improved Parallel Implementations of Gusfield’s Cut Tree Algorithm". En Simpósio em Sistemas Computacionais de Alto Desempenho. Sociedade Brasileira de Computação, 2011. http://dx.doi.org/10.5753/wscad.2011.17275.

Texto completo

Resumen

This work presents parallel versions of Gusfield’s cut tree algorithm and the proposal of two heuristics aimed at improving their performance. Cut trees are a compact representation of the edge-connectivity between every pair of vertices of an undirected graph. Cut trees have a vast number of applications in combinatorial optimization and in the analysis of networks originated in many applied fields. However, surprisingly few works have been published on the practical performance of cut tree algorithms. This paper describes two parallel versions of Gusfield’s cut tree algorithm and presents extensive experimental results which show a significant speedup on most real and synthetic graphs in our dataset.

Los estilos APA, Harvard, Vancouver, ISO, etc.

Oliveira, Andrey, Danilo Sanches y Bruna Osti. "Hybrid greedy genetic algorithm for the Euclidean Steiner tree problem". En Encontro Nacional de Inteligência Artificial e Computacional. Sociedade Brasileira de Computação - SBC, 2019. http://dx.doi.org/10.5753/eniac.2019.9350.

Texto completo

Resumen

This paper presents a genetic algorithm for the Euclidean Steiner tree problem. This is an optimization problem whose objective is to obtain a minimum length tree to interconnect a set of fixed points, and for this purpose to be achieved, new auxiliary points, called Steiner points, can be added. The proposed heuristic uses a genetic algorithm to manipulate spanning trees, which are then transformed into Steiner trees by inserting and repositioning the Steiner points. Greedy genetic operators and evolutionary strategies are tested. Results of numerical experiments for benchmark library problem (OR-Library) are presented and discussed.This paper presents a genetic algorithm for the Euclidean Steiner tree problem. This is an optimization problem whose objective is to obtain a minimum length tree to interconnect a set of fixed points, and for this purpose to be achieved, new auxiliary points, called Steiner points, can be added. The proposed heuristic uses a genetic algorithm to manipulate spanning trees, which are then transformed into Steiner trees by inserting and repositioning the Steiner points. Greedy genetic operators and evolutionary strategies are tested. Results of numerical experiments for benchmark library problem (OR-Library) are presented and discussed.

Los estilos APA, Harvard, Vancouver, ISO, etc.

Audemard, Gilles, Jean-Marie Lagniez, Pierre Marquis y Nicolas Szczepanski. "PyXAI: An XAI Library for Tree-Based Models". En Thirty-Third International Joint Conference on Artificial Intelligence {IJCAI-24}. California: International Joint Conferences on Artificial Intelligence Organization, 2024. http://dx.doi.org/10.24963/ijcai.2024/989.

Texto completo

Resumen

PyXAI (Python eXplainable AI) is a Python library designed for providing explanations and cor- recting tree-based Machine Learning (ML) models. It is suited to decision trees, random forests, and boosted trees, when used for regression or classification tasks. In contrast to many model-agnostic approaches to XAI, PyXAI exploits the model it- self to generate explanations, ensuring them to be faithful. PyXAI includes several algorithms for the generation of explanations, which can be abductive or contrastive. PyXAI also includes algorithms for correcting tree-based models when their predictions conflict with pieces of user knowledge.

Los estilos APA, Harvard, Vancouver, ISO, etc.

Informes sobre el tema "Tree"

Duguma, Lalisa, Peter Minang, Ermias Aynekulu, Sammy Carsan, Judith Nzyoka, Alagie Bah y Ramni Jamnadass. From Tree Planting to Tree Growing: Rethinking Ecosystem Restoration Through Trees. World Agroforestry Centre, 2020. http://dx.doi.org/10.5716/wp20001.pdf.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

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

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

van Doorn, Natalie S., Lara A. Roman, E. Gregory McPherson, Bryant C. Scharenbroch, Jason G. Henning, Johan P. A. Ӧstberg, Lee S. Mueller et al. Urban tree monitoring. Albany, CA: U.S. Department of Agriculture, Forest Service, Pacific Southwest Research Station, 2020. http://dx.doi.org/10.2737/psw-gtr-266.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

Roman, Lara A., Natalie S. van Doorn, E. Gregory McPherson, Bryant C. Scharenbroch, Jason G. Henning, Johan P. A. Ӧstberg, Lee S. Mueller et al. Urban tree monitoring. Madison, WI: U.S. Department of Agriculture, Forest Service, Northern Research Station, septiembre de 2020. http://dx.doi.org/10.2737/nrs-gtr-194.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

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

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

Bjorklund, M. YANG Tree Diagrams. Editado por L. Berger. RFC Editor, marzo de 2018. http://dx.doi.org/10.17487/rfc8340.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

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

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

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

Texto completo

Resumen

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 planned for planting can tolerate a range of future conditions given climate change. This guide can serve as a starting point to learn more on how the impacts of a changing climate can affect trees and ecosystems in your area.

Los estilos APA, Harvard, Vancouver, ISO, etc.

Yong, L. y M. Paul. Ethernet-Tree (E-Tree) Support in Virtual Private LAN Service (VPLS). Editado por Y. Jiang. RFC Editor, marzo de 2016. http://dx.doi.org/10.17487/rfc7796.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

Mize, Carl. Tree Biomass Productivity Project. Ames: Iowa State University, Digital Repository, 2003. http://dx.doi.org/10.31274/farmprogressreports-180814-888.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

Ofrecemos descuentos en todos los planes premium para autores cuyas obras están incluidas en selecciones literarias temáticas. ¡Contáctenos para obtener un código promocional único!