Gotowa bibliografia na temat „Hierarchical graphs”
Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych
Spis treści
Zobacz listy aktualnych artykułów, książek, rozpraw, streszczeń i innych źródeł naukowych na temat „Hierarchical graphs”.
Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.
Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.
Artykuły w czasopismach na temat "Hierarchical graphs"
EADES, PETER, XUEMIN LIN i ROBERTO TAMASSIA. "AN ALGORITHM FOR DRAWING A HIERARCHICAL GRAPH". International Journal of Computational Geometry & Applications 06, nr 02 (czerwiec 1996): 145–55. http://dx.doi.org/10.1142/s0218195996000101.
Pełny tekst źródłaBUSATTO, GIORGIO, HANS-JÖRG KREOWSKI i SABINE KUSKE. "Abstract hierarchical graph transformation". Mathematical Structures in Computer Science 15, nr 4 (15.07.2005): 773–819. http://dx.doi.org/10.1017/s0960129505004846.
Pełny tekst źródłaKasyanov, V. N. "Methods and Tools for Visualization of Graphs and Graph Algorithms". International Journal of Applied Mathematics and Informatics 15 (16.11.2021): 78–84. http://dx.doi.org/10.46300/91014.2021.15.13.
Pełny tekst źródłaFaran, Rachel, i Orna Kupferman. "A Parametrized Analysis of Algorithms on Hierarchical Graphs". International Journal of Foundations of Computer Science 30, nr 06n07 (wrzesień 2019): 979–1003. http://dx.doi.org/10.1142/s0129054119400252.
Pełny tekst źródłaLin, Zhe, Fan Zhang, Xuemin Lin, Wenjie Zhang i Zhihong Tian. "Hierarchical core maintenance on large dynamic graphs". Proceedings of the VLDB Endowment 14, nr 5 (styczeń 2021): 757–70. http://dx.doi.org/10.14778/3446095.3446099.
Pełny tekst źródłaSHARMA, ROHAN, BIBHAS ADHIKARI i TYLL KRUEGER. "SELF-ORGANIZED CORONA GRAPHS: A DETERMINISTIC COMPLEX NETWORK MODEL WITH HIERARCHICAL STRUCTURE". Advances in Complex Systems 22, nr 06 (wrzesień 2019): 1950019. http://dx.doi.org/10.1142/s021952591950019x.
Pełny tekst źródłaEngels, Gregor, i Andy Schürr. "Encapsulated Hierarchical Graphs, Graph Types, and Meta Types". Electronic Notes in Theoretical Computer Science 2 (1995): 101–9. http://dx.doi.org/10.1016/s1571-0661(05)80186-0.
Pełny tekst źródłaWANG, XIAOQIAN, HUILING XU i CHANGBING MA. "CONSENSUS PROBLEMS IN WEIGHTED HIERARCHICAL GRAPHS". Fractals 27, nr 06 (wrzesień 2019): 1950086. http://dx.doi.org/10.1142/s0218348x19500865.
Pełny tekst źródłaOggier, Frédérique, i Anwitaman Datta. "Renyi entropy driven hierarchical graph clustering". PeerJ Computer Science 7 (25.02.2021): e366. http://dx.doi.org/10.7717/peerj-cs.366.
Pełny tekst źródłaKrinkin, Kirill, Alexander Ivanovich Vodyaho, Igor Kulikov i Nataly Zhukova. "Deductive Synthesis of Networks Hierarchical Knowledge Graphs". International Journal of Embedded and Real-Time Communication Systems 12, nr 3 (lipiec 2021): 32–48. http://dx.doi.org/10.4018/ijertcs.2021070103.
Pełny tekst źródłaRozprawy doktorskie na temat "Hierarchical graphs"
Busatto, Giorgio. "An abstract model of hierarchical graphs and hierarchical graph transformation". Oldenburg : Univ., Fachbereich Informatik, 2002. http://deposit.ddb.de/cgi-bin/dokserv?idn=967851955.
Pełny tekst źródłaBusatto, Giorgio [Verfasser]. "An abstract model of hierarchical graphs and hierarchical graph transformation / von Giorgio Busatto". Oldenburg : Univ., Fachbereich Informatik, 2002. http://d-nb.info/967851955/34.
Pełny tekst źródłaDorrian, Henry Joseph. "Hierarchical graphs and oscillator dynamics". Thesis, Manchester Metropolitan University, 2015. http://e-space.mmu.ac.uk/580120/.
Pełny tekst źródłaSlade, Michael L. "A layout algorithm for hierarchical graphs with constraints /". Online version of thesis, 1994. http://hdl.handle.net/1850/11724.
Pełny tekst źródłaPuch-Solis, Roberto O. "Hierarchical junction trees". Thesis, University of Warwick, 2000. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.365243.
Pełny tekst źródłaReynolds, Jason. "A hierarchical layout algorithm for drawing directed graphs". Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1997. http://www.collectionscanada.ca/obj/s4/f2/dsk2/ftp04/mq20694.pdf.
Pełny tekst źródłaWallgrün, Jan Oliver. "Hierarchical Voronoi graphs spatial representation and reasoning for mobile robots". Berlin Heidelberg Springer, 2008. http://d-nb.info/99728210X/04.
Pełny tekst źródłaSpisla, Christiane [Verfasser]. "Compaction of Orthogonal and Hierarchical Graph Drawings Using Constraint Graphs and Minimum Cost Flows / Christiane Spisla". München : Verlag Dr. Hut, 2019. http://d-nb.info/119641467X/34.
Pełny tekst źródłaSantana, Maia Deise. "A study of hierarchical watersheds on graphs with applications to image segmentation". Thesis, Paris Est, 2019. http://www.theses.fr/2019PESC2069.
Pełny tekst źródłaThe wide literature on graph theory invites numerous problems to be modeled in the framework of graphs. In particular, clustering and segmentation algorithms designed this framework can be applied to solve problems in various domains, including image processing, which is the main field of application investigated in this thesis. In this work, we focus on a semi-supervised segmentation tool widely studied in mathematical morphology and used in image analysis applications, namely the watershed transform. We explore the notion of a hierarchical watershed, which is a multiscale extension of the notion of watershed allowing to describe an image or, more generally, a dataset with partitions at several detail levels. The main contributions of this study are the following : - Recognition of hierarchical watersheds : we propose a characterization of hierarchical watersheds which leads to an efficient algorithm to determine if a hierarchy is a hierarchical watershed of a given edge-weighted graph. - Watersheding operator : we introduce the watersheding operator, which, given an edge-weighted graph, maps any hierarchy of partitions into a hierarchical watershed of this edge-weighted graph. We show that this operator is idempotent and its fixed points are the hierarchical watersheds. We also propose an efficient algorithm to compute the result of this operator. - Probability of hierarchical watersheds : we propose and study a notion of probability of hierarchical watersheds, and we design an algorithm to compute the probability of a hierarchical watershed. Furthermore, we present algorithms to compute the hierarchical watersheds of maximal and minimal probabilities of a given weighted graph. - Combination of hierarchies : we investigate a family of operators to combine hierarchies of partitions and study the properties of these operators when applied to hierarchical watersheds. In particular, we prove that, under certain conditions, the family of hierarchical watersheds is closed for the combination operator. - Evaluation of hierarchies : we propose an evaluation framework of hierarchies, which is further used to assess hierarchical watersheds and combinations of hierarchies. In conclusion, this thesis reviews existing and introduces new properties and algorithms related to hierarchical watersheds, showing the theoretical richness of this framework and providing insightful view for its applications in image analysis and computer vision and, more generally, for data processing and machine learning
Charpentier, Bertrand. "Multi-scale clustering in graphs using modularity". Thesis, KTH, Skolan för elektroteknik och datavetenskap (EECS), 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-244847.
Pełny tekst źródłaDenna avhandling ger en ny hierarkisk klusteralgoritm för grafer, som heter Paris, vilket kan tolkas av modularitetsresultatet och dess upplösningsparameter. Algoritmen är agglomerativ och är baserad på ett enda avstånd mellan kluster som induceras av sannolikheten för sampling av nodpar. Det försöker att approximera de optimala partitionerna vid vilken upplösning som helst i en körning. Förutom en hierarkisk algoritm föreslår denna avhandling fyra algoritmer som beräknar rankningar av de bästa grupperna, kluster och resolutioner genom att bearbeta hierarkiproduktionen i Paris. Dessa algoritmer bygger på ett nytt koncept av klusterstabilitet, kallad sharpscore. Viktiga resultat av dessa fyra algoritmer är förmågan att rangordna kluster, upptäcka bästa klusterskala, gå utöver upplösningsgränsen och upptäcka de mest relevanta resolutionerna. Alla dessa algoritmer har testats på både syntetiska och verkliga datamängder för att illustrera effektiviteten i deras metoder.
Książki na temat "Hierarchical graphs"
Wallgrün, Jan Oliver. Hierarchical Voronoi Graphs. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-10345-2.
Pełny tekst źródłaMikov, Aleksandr. Generalized graphs and grammars. ru: INFRA-M Academic Publishing LLC., 2021. http://dx.doi.org/10.12737/1013698.
Pełny tekst źródłaWallgrün, Jan Oliver. Hierarchical Voronoi graphs: Spatial representation and reasoning for mobile robots. Heidelberg: Springer, 2010.
Znajdź pełny tekst źródłaComputer Systems Laboratory (U.S.), red. Programmer's Hierarchical Interactive Graphics System (PHIGS). Gaithersburg, MD: U.S. Dept. of Commerce, Technology Administration, National Institute of Standards and Technology, Computer Systems Laboratory, 1995.
Znajdź pełny tekst źródłaBos, Jan van den, 1939-, red. 3D interactive computer graphics: The hierarchical modelling system HIRASP. New York: Ellis Horwood, 1990.
Znajdź pełny tekst źródłaWallgrün, Jan Oliver. Hierarchical Voronoi Graphs: Spatial Representation and Reasoning for Mobile Robots. Springer, 2010.
Znajdź pełny tekst źródłaCoolen, A. C. C., A. Annibale i E. S. Roberts. Specific constructions. Oxford University Press, 2017. http://dx.doi.org/10.1093/oso/9780198709893.003.0009.
Pełny tekst źródłaProgrammer's Hierarchical Interactive Graphics System by Example. Springer Verlag, 1991.
Znajdź pełny tekst źródłaYust, Jason. Graph Theory for Temporal Structure. Oxford University Press, 2018. http://dx.doi.org/10.1093/oso/9780190696481.003.0014.
Pełny tekst źródłaFarin, Gerald, Bernd Hamann i Hans Hagen. Hierarchical and Geometrical Methods in Scientific Visualization. Springer, 2011.
Znajdź pełny tekst źródłaCzęści książek na temat "Hierarchical graphs"
Wallgrün, Jan Oliver. "Introduction". W Hierarchical Voronoi Graphs, 1–9. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-10345-2_1.
Pełny tekst źródłaWallgrün, Jan Oliver. "Robot Mapping". W Hierarchical Voronoi Graphs, 11–43. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-10345-2_2.
Pełny tekst źródłaWallgrün, Jan Oliver. "Voronoi-Based Spatial Representations". W Hierarchical Voronoi Graphs, 45–58. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-10345-2_3.
Pełny tekst źródłaWallgrün, Jan Oliver. "Simplification and Hierarchical Voronoi Graph Construction". W Hierarchical Voronoi Graphs, 59–84. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-10345-2_4.
Pełny tekst źródłaWallgrün, Jan Oliver. "Voronoi Graph Matching for Data Association". W Hierarchical Voronoi Graphs, 85–111. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-10345-2_5.
Pełny tekst źródłaWallgrün, Jan Oliver. "Global Mapping: Minimal Route Graphs Under Spatial Constraints". W Hierarchical Voronoi Graphs, 113–46. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-10345-2_6.
Pełny tekst źródłaWallgrün, Jan Oliver. "Experimental Evaluation". W Hierarchical Voronoi Graphs, 147–76. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-10345-2_7.
Pełny tekst źródłaWallgrün, Jan Oliver. "Conclusions and Outlook". W Hierarchical Voronoi Graphs, 177–86. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-10345-2_8.
Pełny tekst źródłaPalomo, E. J., J. M. Ortiz-de-Lazcano-Lobato, Domingo López-Rodríguez i R. M. Luque. "Hierarchical Graphs for Data Clustering". W Lecture Notes in Computer Science, 432–39. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-02478-8_54.
Pełny tekst źródłaFernández-Baca, David, i Mark A. Williams. "On matroids and hierarchical graphs". W SWAT 90, 320–31. Berlin, Heidelberg: Springer Berlin Heidelberg, 1990. http://dx.doi.org/10.1007/3-540-52846-6_101.
Pełny tekst źródłaStreszczenia konferencji na temat "Hierarchical graphs"
Li, Chong, Kunyang Jia, Dan Shen, C. J. Richard Shi i Hongxia Yang. "Hierarchical Representation Learning for Bipartite Graphs". W Twenty-Eighth International Joint Conference on Artificial Intelligence {IJCAI-19}. California: International Joint Conferences on Artificial Intelligence Organization, 2019. http://dx.doi.org/10.24963/ijcai.2019/398.
Pełny tekst źródłaZhou, Kaixiong, Qingquan Song, Xiao Huang, Daochen Zha, Na Zou i Xia Hu. "Multi-Channel Graph Neural Networks". W Twenty-Ninth International Joint Conference on Artificial Intelligence and Seventeenth Pacific Rim International Conference on Artificial Intelligence {IJCAI-PRICAI-20}. California: International Joint Conferences on Artificial Intelligence Organization, 2020. http://dx.doi.org/10.24963/ijcai.2020/188.
Pełny tekst źródłaIsmaeel, Alaa A. K., Pradyumn Kumar Shukla i Hartmut Schmeck. "Dynamic Drawing of Hierarchical Graphs". W Annual International Conference on Computational Mathematics, Computational Geometry & Statistics. Global Science and Technology Forum (GSTF), 2012. http://dx.doi.org/10.5176/2251-1911_cmcgs52.
Pełny tekst źródłaZhang, Ying, Lu Qin, Fan Zhang i Wenjie Zhang. "Hierarchical Decomposition of Big Graphs". W 2019 IEEE 35th International Conference on Data Engineering (ICDE). IEEE, 2019. http://dx.doi.org/10.1109/icde.2019.00240.
Pełny tekst źródłaPandey, Prashant, Brian Wheatman, Helen Xu i Aydin Buluc. "Terrace: A Hierarchical Graph Container for Skewed Dynamic Graphs". W SIGMOD/PODS '21: International Conference on Management of Data. New York, NY, USA: ACM, 2021. http://dx.doi.org/10.1145/3448016.3457313.
Pełny tekst źródłaLeon, Leissi M. Castañeda, Krzysztof Chris Ciesielski i Paulo A. Vechiatto Miranda. "An Efficient Hierarchical Layered Graph Approach for Multi-Region Segmentation". W XXXII Conference on Graphics, Patterns and Images. Sociedade Brasileira de Computação - SBC, 2019. http://dx.doi.org/10.5753/sibgrapi.est.2019.8301.
Pełny tekst źródłaWang, Bin, Teruaki Hayashi i Yukio Ohsawa. "Hierarchical Graph Convolutional Network for Data Evaluation of Dynamic Graphs". W 2020 IEEE International Conference on Big Data (Big Data). IEEE, 2020. http://dx.doi.org/10.1109/bigdata50022.2020.9377789.
Pełny tekst źródłaChua, Freddy Chong Tat, i Ee-Peng Lim. "Modeling Bipartite Graphs Using Hierarchical Structures". W 2011 International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2011). IEEE, 2011. http://dx.doi.org/10.1109/asonam.2011.45.
Pełny tekst źródłaGordeev, Dmitrii Stanislavovich. "Visualization and debugging on internal representation graph of Cloud-Sisal programs". W 31th International Conference on Computer Graphics and Vision. Keldysh Institute of Applied Mathematics, 2021. http://dx.doi.org/10.20948/graphicon-2021-1-54-62.
Pełny tekst źródłaWang, Hanchen, Defu Lian, Ying Zhang, Lu Qin i Xuemin Lin. "GoGNN: Graph of Graphs Neural Network for Predicting Structured Entity Interactions". W Twenty-Ninth International Joint Conference on Artificial Intelligence and Seventeenth Pacific Rim International Conference on Artificial Intelligence {IJCAI-PRICAI-20}. California: International Joint Conferences on Artificial Intelligence Organization, 2020. http://dx.doi.org/10.24963/ijcai.2020/183.
Pełny tekst źródłaRaporty organizacyjne na temat "Hierarchical graphs"
Tripakis, Stavros, Dai Bui, Bert Rodiers i Edward A. Lee. Compositionality in Synchronous Data Flow: Modular Code Generation from Hierarchical SDF Graphs. Fort Belvoir, VA: Defense Technical Information Center, październik 2009. http://dx.doi.org/10.21236/ada538756.
Pełny tekst źródłaMathuria, Aakanksha. Approximate Pattern Matching using Hierarchical Graph Construction and Sparse Distributed Representation. Portland State University Library, styczeń 2000. http://dx.doi.org/10.15760/etd.7453.
Pełny tekst źródłaWells, Aaron, Tracy Christopherson, Gerald Frost, Matthew Macander, Susan Ives, Robert McNown i Erin Johnson. Ecological land survey and soils inventory for Katmai National Park and Preserve, 2016–2017. National Park Service, wrzesień 2021. http://dx.doi.org/10.36967/nrr-2287466.
Pełny tekst źródłaFederal Information Processing Standards Publication: programmer's hierarchial interactive graphics sytem (PHIGS). Gaithersburg, MD: National Institute of Standards and Technology, 1995. http://dx.doi.org/10.6028/nist.fips.153-1.
Pełny tekst źródłaUser's guide for the Programmer's hierarchical interactive graphics system (PHIGS) C binding validation tests (version 2). Gaithersburg, MD: National Institute of Standards and Technology, 1993. http://dx.doi.org/10.6028/nist.ir.5238.
Pełny tekst źródła