Gotowa bibliografia na temat „Median 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 „Median 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 "Median graphs"
Klavžar, Sandi, i Riste Škrekovski. "On median graphs and median grid graphs". Discrete Mathematics 219, nr 1-3 (maj 2000): 287–93. http://dx.doi.org/10.1016/s0012-365x(00)00085-6.
Pełny tekst źródłaImrich, Wilfried, Sandi Klavzar i Henry Martyn Mulder. "Median Graphs and Triangle-Free Graphs". SIAM Journal on Discrete Mathematics 12, nr 1 (styczeń 1999): 111–18. http://dx.doi.org/10.1137/s0895480197323494.
Pełny tekst źródłaSeemann, Carsten R., Vincent Moulton, Peter F. Stadler i Marc Hellmuth. "Planar median graphs and cubesquare-graphs". Discrete Applied Mathematics 331 (maj 2023): 38–58. http://dx.doi.org/10.1016/j.dam.2023.01.022.
Pełny tekst źródłaMcMorris, F. R., Henry Martyn Mulder i Fred S. Roberts. "The median procedure on median graphs". Discrete Applied Mathematics 84, nr 1-3 (maj 1998): 165–81. http://dx.doi.org/10.1016/s0166-218x(98)00003-1.
Pełny tekst źródłaVesel, Aleksander. "Recognizing pseudo-median graphs". Discrete Applied Mathematics 116, nr 3 (luty 2002): 261–69. http://dx.doi.org/10.1016/s0166-218x(00)00327-9.
Pełny tekst źródłaSIGARRETA, JOSÉ M. "Hyperbolicity in median graphs". Proceedings - Mathematical Sciences 123, nr 4 (27.10.2013): 455–67. http://dx.doi.org/10.1007/s12044-013-0149-0.
Pełny tekst źródłaBrešar, Boštjan. "Characterizing almost-median graphs". European Journal of Combinatorics 28, nr 3 (kwiecień 2007): 916–20. http://dx.doi.org/10.1016/j.ejc.2005.10.009.
Pełny tekst źródłaBandelt, Hans-Jürgen, i Henry Martyn Mulder. "Regular pseudo-median graphs". Journal of Graph Theory 12, nr 4 (1988): 533–49. http://dx.doi.org/10.1002/jgt.3190120410.
Pełny tekst źródłaTardif, Claude. "On compact median graphs". Journal of Graph Theory 23, nr 4 (grudzień 1996): 325–36. http://dx.doi.org/10.1002/(sici)1097-0118(199612)23:4<325::aid-jgt1>3.0.co;2-t.
Pełny tekst źródłaChastand, Marc, i Norbert Polat. "Invariant Hamming graphs in infinite quasi-median graphs". Discrete Mathematics 160, nr 1-3 (listopad 1996): 93–104. http://dx.doi.org/10.1016/0012-365x(95)00151-l.
Pełny tekst źródłaRozprawy doktorskie na temat "Median graphs"
Genevois, Anthony. "Cubical-like geometry of quasi-median graphs and applications to geometric group theory". Thesis, Aix-Marseille, 2017. http://www.theses.fr/2017AIXM0569/document.
Pełny tekst źródłaThe class of quasi-median graphs is a generalisation of median graphs, or equivalently of CAT(0) cube complexes. The purpose of this thesis is to introduce these graphs in geometric group theory. In the first part of our work, we extend the definition of hyperplanes from CAT(0) cube complexes, and we show that the geometry of a quasi-median graph essentially reduces to the combinatorics of its hyperplanes. In the second part, we exploit the specific structure of the hyperplanes to state combination results. The main idea is that if a group acts in a suitable way on a quasi-median graph so that clique-stabilisers satisfy some non-positively curved property P, then the whole group must satisfy P as well. The properties we are interested in are mainly (relative) hyperbolicity, (equivariant) lp-compressions, CAT(0)-ness and cubicality. In the third part, we apply our general criteria to several classes of groups, including graph products, Guba and Sapir's diagram products, some wreath products, and some graphs of groups. Graph products are our most natural examples, where the link between the group and its quasi-median graph is particularly strong and explicit; in particular, we are able to determine precisely when a graph product is relatively hyperbolic
Bénéteau, Laurine. "Médians de graphes : algorithmes, connexité et axiomatique". Electronic Thesis or Diss., Aix-Marseille, 2022. http://www.theses.fr/2022AIXM0512.
Pełny tekst źródłaThe median problem is one of the most investigated problem in metric graph theory. We will start by studying this problem in median graphs. We present a linear time algorithm based on the majority rule which characterize the median in median graphs and on a fast computation of the parallelism classes of the edges (the \Theta-classes) via LexBFS which is a particular breadth first search algorithm.We also provide linear time algorithms to compute the median set in the l_1-cube complexes of median graphs and in event structures. Then, we provide a characterization of the graphs with connected medians in the pth power of the graph and provide a polynomial method to check if a graph is a G^p-connected median graph, extending a result of Bandelt and Chepoi (case p=1). We use this characterization to prove that some important graph classes in metric graph theory have G2-connected medians, such as bipartite Helly graphs and bridged graphs. We will also studied the axiomatic aspect of the median function by investigating the ABC-problem, which determine the graphs (named ABC-graphs) in which the median function is the only consensus function verifying three simples axioms (A) Anonymat, (B) Betweeness and (C) Consistency. We show that modular graphs with G2-connected medians are ABC-graphs and define new axioms allowing us to characterize the median function on some graph classes. For example the graphs with connected medians (including Helly graphs). We also show that a known class of ABC-graphs (graphs satisfying the pairing property) is a proper subclass of bipartite Helly graphs and we investigate their recognition
Ren, Haolin. "Visualizing media with interactive multiplex networks". Thesis, Bordeaux, 2019. http://www.theses.fr/2019BORD0036/document.
Pełny tekst źródłaNowadays, information follows complex paths: information propagation involving on-line editors, 24-hour news providers and social medias following entangled paths acting on information content and perception. This thesis studies the adaptation of classical graph measurements to multiplex graphs, to build visualizations from several graphical representations of the networks, and to combine them (synchronized multi-view visualizations, hybrid representations, etc.). Emphasis is placed on the modes of interaction allowing to take in hand the multiplex nature (multilayer) of the networks. These representations and interactive manipulations are also based on the calculation of indicators specific to multiplex networks. The work is based on two main datasets: one is a 12-year archive of the Japanese public daily broadcast NHK News 7, from 2001 to 2013. Another lists the participants in the French TV/radio shows between 2010 and 2015. Two visualization systems based on a Web interface have been developed for multiplex network analysis, which we call "Visual Cloud" and "Laputa". In the Visual Cloud, we formally define a notion of similarity between concepts and groups of concepts that we call co-occurrence possibility (CP). According to this definition, we propose a hierarchical classification algorithm. We aggregate the layers in a multiplex network of documents, and integrate that hierarchy into an interactive word cloud. Here we improve the traditional word cloud layout algorithms so as to preserve the constraints on the concept hierarchy. The Laputa system is intended for the complex analysis of dense and multidimensional temporal networks. To do this, it associates a graph with a segmentation. The segmentation by communities, by attributes, or by time slices, forms views of this graph. In order to associate these views with the global whole, we use Sankey diagrams to reveal the evolution of the communities (diagrams that we have increased with a semantic zoom). This thesis allows us to browse three aspects of the most interesting aspects of the data miming and BigData applied to multimedia archives: The Volume since our archives are immense and reach orders of magnitude that are usually not practicable for the visualization; Velocity, because of the temporal nature of our data (by definition). The Variety that is a corollary of the richness of multimedia data and of all that one may wish to want to investigate. What we can retain from this thesis is that we met each of these three challenges by taking an answer in the form of a multiplex network analysis. These structures are always at the heart of our work, whether in the criteria for filtering edges using the Simmelian backbone algorithm, or in the superposition of time slices in the complex networks, or much more directly in the combinations of visual and textual semantic indices for which we extract hierarchies allowing our visualization
Tawfik, Israa. "Links and graphs". Thesis, University of Plymouth, 2013. http://hdl.handle.net/10026.1/2863.
Pełny tekst źródłaWu, Diing-Wuu Vale. "Introduction to fractal by using interactive media design /". Online version of thesis, 1991. http://hdl.handle.net/1850/11287.
Pełny tekst źródłaMonterio, Carlos Eduardo Ferreira. "Investigating critical sense in the interpretation of media graphs". Thesis, University of Warwick, 2005. http://wrap.warwick.ac.uk/73122/.
Pełny tekst źródłaFerrer, Sumsi Miquel. "Theory and Algorithms on the Median Graph. Application to Graph-based Classification and Clustering". Doctoral thesis, Universitat Autònoma de Barcelona, 2008. http://hdl.handle.net/10803/5788.
Pełny tekst źródłaEn el reconeixement estructural de patrons, els grafs han estat usats normalment per a representar objectes complexos. En el domini dels grafs, el concepte de mediana és conegut com median graph. Potencialment, té les mateixes aplicacions que el concepte de mediana per poder ser usat com a representant d'un conjunt de grafs.
Tot i la seva simple definició i les potencials aplicacions, s'ha demostrat que el seu càlcul és una tasca extremadament complexa. Tots els algorismes existents només han estat capaços de treballar amb conjunts petits de grafs, i per tant, la seva aplicació ha estat limitada en molts casos a usar dades sintètiques sense significat real. Així, tot i el seu potencial, ha restat com un concepte eminentment teòric.
L'objectiu principal d'aquesta tesi doctoral és el d'investigar a fons la teoria i l'algorísmica relacionada amb el concepte de medinan graph, amb l'objectiu final d'extendre la seva aplicabilitat i lliurar tot el seu potencial al món de les aplicacions reals. Per això, presentem nous resultats teòrics i també nous algorismes per al seu càlcul. Des d'un punt de vista teòric aquesta tesi fa dues aportacions fonamentals. Per una banda, s'introdueix el nou concepte d'spectral median graph. Per altra banda es mostra que certes de les propietats teòriques del median graph poden ser millorades sota determinades condicions. Més enllà de les aportacioncs teòriques, proposem cinc noves alternatives per al seu càlcul. La primera d'elles és una conseqüència directa del concepte d'spectral median graph. Després, basats en les millores de les propietats teòriques, presentem dues alternatives més per a la seva obtenció. Finalment, s'introdueix una nova tècnica per al càlcul del median basat en el mapeig de grafs en espais de vectors, i es proposen dos nous algorismes més.
L'avaluació experimental dels mètodes proposats utilitzant una base de dades semi-artificial (símbols gràfics) i dues amb dades reals (mollècules i pàgines web), mostra que aquests mètodes són molt més eficients que els existents. A més, per primera vegada, hem demostrat que el median graph pot ser un bon representant d'un conjunt d'objectes utilitzant grans quantitats de dades. Hem dut a terme experiments de classificació i clustering que validen aquesta hipòtesi i permeten preveure una pròspera aplicació del median graph a un bon nombre d'algorismes d'aprenentatge.
Given a set of objects, the generic concept of median is defined as the object with the smallest sum of distances to all the objects in the set. It has been often used as a good alternative to obtain a representative of the set.
In structural pattern recognition, graphs are normally used to represent structured objects. In the graph domain, the concept analogous to the median is known as the median graph. By extension, it has the same potential applications as the generic median in order to be used as the representative of a set of graphs.
Despite its simple definition and potential applications, its computation has been shown as an extremely complex task. All the existing algorithms can only deal with small sets of graphs, and its application has been constrained in most cases to the use of synthetic data with no real meaning. Thus, it has mainly remained in the box of the theoretical concepts.
The main objective of this work is to further investigate both the theory and the algorithmic underlying the concept of the median graph with the final objective to extend its applicability and bring all its potential to the world of real applications. To this end, new theory and new algorithms for its computation are reported. From a theoretical point of view, this thesis makes two main contributions. On one hand, the new concept of spectral median graph. On the other hand, we show that some of the existing theoretical properties of the median graph can be improved under some specific conditions. In addition to these theoretical contributions, we propose five new ways to compute the median graph. One of them is a direct consequence of the spectral median graph concept. In addition, we provide two new algorithms based on the new theoretical properties. Finally, we present a novel technique for the median graph computation based on graph embedding into vector spaces. With this technique two more new algorithms are presented.
The experimental evaluation of the proposed methods on one semi-artificial and two real-world datasets, representing graphical symbols, molecules and webpages, shows that these methods are much more ecient than the existing ones. In addition, we have been able to proof for the first time that the median graph can be a good representative of a class in large datasets. We have performed some classification and clustering experiments that validate this hypothesis and permit to foresee a successful application of the median graph to a variety of machine learning algorithms.
Yang, Mengta. "Depth Functions, Multidimensional Medians and Tests of Uniformity on Proximity Graphs". Thesis, The George Washington University, 2014. http://pqdtopen.proquest.com/#viewpdf?dispub=3615104.
Pełny tekst źródłaWe represent the d-dimensional random vectors as vertices of a complete weighted graph and propose depth functions that are applicable to distributions in d-dimensional spaces and data on graphs. We explore the proximity graphs, examine their connection to existing depth functions, define a family of depth functions on the β-skeleton graph, suggest four types of depth functions on the minimal spanning tree (MST) and define depth functions including path depth, path depth of path length at most δ, all paths probability depth, eccentricity depth, peeling depth and RUNT depth. We study their properties, including affine invariance, maximality at the center, monotonicity and vanishing at infinity. We show that the β-skeleton depth is a family of statistical depth functions and define the sample β-skeleton depth function. We show that it has desirable asymptotic properties, including uniform consistency and asymptotic normality. We consider the corresponding multidimensional medians, investigate their robustness, computational complexity, compare them in a simulation study to find the multivariate medians under different distributions and sample sizes and explore the asymptotic properties of β-skeleton median. We generalize the univariate Greenwood statistic and Hegazy-Green statistic using depth induced order statistics and propose two new test statistics based on normal copula and interpoint distances for testing multivariate uniformity. We generalize the path depth under two-sample setting and propose a new multivariate equality of DF test. We study their empirical power against several copula and multivariate Beta alternatives. The topic is complemented with a discussion on the distribution and moments of the interpoint distances (ID) between bivariate uniform random vectors and the IDs between FGM copula random vectors.
Ratel, Sébastien. "Densité, VC-dimension et étiquetages de graphes". Electronic Thesis or Diss., Aix-Marseille, 2019. http://www.theses.fr/2019AIXM0427.
Pełny tekst źródłaConstructing labeling schemes supporting adjacency, distance or routing queries constituted the initial motivation of most of the results of this document. However, this manuscript concerns problem of more general interest such as bounding the density of graphs, studying the VC-dimension of set families, or investigating on metric and structural properties of graphs. As a first contribution, we upper bound the density of the subgraphs of Cartesian products of graphs, and of the subgraphs of halved-cubes. To do so, we extend the classical notion of VC-dimension (already used in 1994 by Haussler, Littlestone, and Warmuth to upper bound the density of the subgraphs of hypercubes). From our results, we deduce upper bounds on the size of labels used by an adjacency labeling scheme on these graph classes. We then investigate on distance and routing labeling schemes for two important families of metric graph theory: median graphs and bridged graphs. We first show that the class of cube-free median graphs on n vertices enjoys distance and routing labeling schemes both using labels of O(\log^3 n) bits. These labels can be decoded in constant time to respectively return the exact distance between two vertices, or a port to take from a source vertex in order to get (strictly) closer to a target one. We then describe an approximate distance labeling scheme for the family of K_4-free bridged graphs on n vertices. This scheme also uses labels of size O(\log^3 n) that can be decoded in constant time to return a value of at most four time the exact distance between two vertices
Johansson, Erik. "Phos Graphis". Thesis, Blekinge Tekniska Högskola, Sektionen för teknokultur, humaniora och samhällsbyggnad, 2006. http://urn.kb.se/resolve?urn=urn:nbn:se:bth-1627.
Pełny tekst źródłaKsiążki na temat "Median graphs"
Interactive design 2: The international collection of new media design = die Gestaltung der neuen Medien im internationale Überblick = le design des nouveaux médias dans le monde. New York: Graphis Inc., 2001.
Znajdź pełny tekst źródłaMedia literacy: Grades 7-8. Westminster, CA: Teacher Created Resources, 2008.
Znajdź pełny tekst źródłaJorinde, Seijdel, i Velthoven Willem, red. Multi-media graphics. London: Thames and Hudson, 1996.
Znajdź pełny tekst źródłaIinkai, JAGDA Intānetto. Dejitaru media to Nihon no gurafikku dezain: Sono kako to mirai = Digital media and Japanese graphic design : its past and future. Tōkyō: Seibundō Shinkōsha, 2017.
Znajdź pełny tekst źródłaN, Baird Russell, red. The Graphics of communication: Methods, media, and technology. Wyd. 6. Fort Worth: Harcourt Brace Jovanovich College Pub., 1993.
Znajdź pełny tekst źródłaW, Dyal William, Eddins Donald L i Centers for Disease Control (U.S.), red. Descriptive statistics: Tables, graphs, & charts. Atlanta, Ga: U.S. Dept. of Health and Human Services, Public Health Service, Centers for Disease Control, 1988.
Znajdź pełny tekst źródła), Cicero Public Schools (Ill. Integrated media curriculum: [grades 4-6]. [Cicero, Ill.]: The Schools, 1988.
Znajdź pełny tekst źródłaDaniel, Drennan, red. The digital designer: The graphic artist's guide to the new media. New York: Watson-Guptil Publications, 1997.
Znajdź pełny tekst źródłaUtah State Board of Education. Library media skills core curriculum, grades K-11. [Salt Lake City, Utah: Utah Office of Education], 1991.
Znajdź pełny tekst źródłaMaeda@media. London: Thames & Hudson, 2000.
Znajdź pełny tekst źródłaCzęści książek na temat "Median graphs"
Serratosa, Francesc, Albert Solé-Ribalta i Enric Vidiella. "Graph Indexing and Retrieval Based on Median Graphs". W Advances in Pattern Recognition, 311–21. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-15992-3_33.
Pełny tekst źródłaPravas, K., i A. Vijayakumar. "The Median Problem on Symmetric Bipartite Graphs". W Theoretical Computer Science and Discrete Mathematics, 262–70. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-64419-6_34.
Pełny tekst źródłaFerrer, Miquel, Ernest Valveny i Francesc Serratosa. "Spectral Median Graphs Applied to Graphical Symbol Recognition". W Lecture Notes in Computer Science, 774–83. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11892755_80.
Pełny tekst źródłaChangat, Manoj, Divya Sindhu Lekha, Henry Martyn Mulder i Ajitha R. Subhamathi. "Axiomatic Characterization of the Median and Antimedian Functions on Cocktail-Party Graphs and Complete Graphs". W Algorithms and Discrete Applied Mathematics, 138–49. Cham: Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-14974-5_14.
Pełny tekst źródłaDereniowski, Dariusz, Aleksander Łukasiewicz i Przemysław Uznański. "An Efficient Noisy Binary Search in Graphs via Median Approximation". W Lecture Notes in Computer Science, 265–81. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-79987-8_19.
Pełny tekst źródłaBardaji, Itziar, Miquel Ferrer i Alberto Sanfeliu. "A Comparison between Two Representatives of a Set of Graphs: Median vs. Barycenter Graph". W Lecture Notes in Computer Science, 149–58. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-14980-1_14.
Pełny tekst źródłaThorup, Mikkel. "Quick k-Median, k-Center, and Facility Location for Sparse Graphs". W Automata, Languages and Programming, 249–60. Berlin, Heidelberg: Springer Berlin Heidelberg, 2001. http://dx.doi.org/10.1007/3-540-48224-5_21.
Pełny tekst źródłaBai, Chunsong, i Liying Kang. "The 2-Median Problem on Cactus Graphs with Positive and Negative Weights". W Combinatorial Optimization and Applications, 278–85. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-71150-8_24.
Pełny tekst źródłaFerguson, Daniel, i François G. Meyer. "On the Number of Edges of the Fréchet Mean and Median Graphs". W Network Science, 26–40. Cham: Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-030-97240-0_3.
Pełny tekst źródłaEppstein, David. "Algorithms for Drawing Media". W Graph Drawing, 173–83. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/978-3-540-31843-9_19.
Pełny tekst źródłaStreszczenia konferencji na temat "Median graphs"
Mukherjee, Lopamudra, Vikas Singh, Jiming Peng, Jinhui Xu, Michael J. Zeitz i Ronald Berezney. "Generalized Median Graphs: Theory and Applications". W 2007 IEEE 11th International Conference on Computer Vision. IEEE, 2007. http://dx.doi.org/10.1109/iccv.2007.4408966.
Pełny tekst źródłaYan-Qin, Bai, Wang Qin i Tai Wei-Ying. "The inverse 1-median problem on star graphs". W Education (ICCSE 2010). IEEE, 2010. http://dx.doi.org/10.1109/iccse.2010.5593677.
Pełny tekst źródłaDickinson, P., H. Bunke, A. Dadej i M. Kraetzl. "Median graphs and anomalous change detection in communication networks". W Information, Decision and Control. IEEE, 2002. http://dx.doi.org/10.1109/idc.2002.995366.
Pełny tekst źródłaZhou, Xiong, Hanzi Wang, Guobao Xiao, Xing Wang, Yan Yan i Liming Zhang. "Weighted median-shift on graphs for geometric model fitting". W 2017 IEEE International Conference on Image Processing (ICIP). IEEE, 2017. http://dx.doi.org/10.1109/icip.2017.8296342.
Pełny tekst źródłaChen, Zihe, Hu Ding, Danyang Chen, Xiangyu Wang, Andrew Fritz, Nitasha Sehgal, Ronald Berezney i Jinhui Xu. "Mining k-median chromosome association graphs from a population of heterogeneous cells". W BCB '15: ACM International Conference on Bioinformatics, Computational Biology and Biomedicine. New York, NY, USA: ACM, 2015. http://dx.doi.org/10.1145/2808719.2808724.
Pełny tekst źródłaFerguson, Kevin, James Hardin, Andrew Gillman i Levent Burak Kara. "Scalar Field Prediction on Topologically-Varying Graphs Using Spectral Shape Encoding". W ASME 2022 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. American Society of Mechanical Engineers, 2022. http://dx.doi.org/10.1115/detc2022-91209.
Pełny tekst źródłaVidal, Victor, Tássia Bastos, Rafael Ferreira Mello, Péricles Miranda i André C. A. Nascimento. "On the impact of missing value imputation methods for multiple kernel learning on bipartite graphs". W Encontro Nacional de Inteligência Artificial e Computacional. Sociedade Brasileira de Computação - SBC, 2023. http://dx.doi.org/10.5753/eniac.2023.233884.
Pełny tekst źródłaMcWherter, David, Mitchell Peabody, William C. Regli i Ali Shokoufandeh. "Transformation Invariant Shape Similarity Comparison of Solid Models". W ASME 2001 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. American Society of Mechanical Engineers, 2001. http://dx.doi.org/10.1115/detc2001/dfm-21191.
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łaSirico, Anthony, i Daniel R. Herber. "On the Use of Geometric Deep Learning Towards the Evaluation of Graph-Centric Engineering Systems". W ASME 2023 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. American Society of Mechanical Engineers, 2023. http://dx.doi.org/10.1115/detc2023-114592.
Pełny tekst źródłaRaporty organizacyjne na temat "Median graphs"
Salamanca Velandia, Sandra Rocío, Juliana Marín Mancipe, Silvia Alejandra González i Elenith Pérez Acevedo. Prevención de la ansiedad en estudiantes de instituciones educativas de media vocacional. Ediciones Universidad Cooperativa de Colombia, grudzień 2022. http://dx.doi.org/10.16925/gcnc.33.
Pełny tekst źródłaGreen, Nancy, Giuseppe Carenini, Stephen Kerpedjiev, Steven Roth i Johanna Moore. A Media-Independent Content Language for Integrated Text and Graphics Generation. Fort Belvoir, VA: Defense Technical Information Center, styczeń 1998. http://dx.doi.org/10.21236/ada459464.
Pełny tekst źródłaBorja Buitrago, Diana. Bases para la construcción de un urbanismo prioritario para la reducción de la pobreza y la desigualdad social en Quibdó, Colombia. Propuesta de Plan de Indicadores y Líneas Estratégicas de Desarrollo Urbano. Fundación Carolina, czerwiec 2021. http://dx.doi.org/10.33960/issn-e.1885-9119.dte5.
Pełny tekst źródłaNalla, Vineetha, i Nihal Ranjit. Afterwards: Graphic Narratives of Disaster Risk and Recovery from India. Indian Institute for Human Settlements, 2022. http://dx.doi.org/10.24943/9788195648559.
Pełny tekst źródłaMikhaleva, E., E. Babikova, G. Bezhashvili, M. Ilina i I. Samkova. VALUE STREAM PROGRAM. Sverdlovsk Regional Medical College, grudzień 2022. http://dx.doi.org/10.12731/er0618.03122022.
Pełny tekst źródłaNalla, Vineetha, Nihal Ranjit, Yashodara Udupa, Mythili Madhavan, Jasmitha Arvind, Garima Jain i Teja Malladi. Afterwards – Graphic Narratives of Disaster Risk and Recovery from India (Volume Set). Indian Institute for Human Settlements, 2022. http://dx.doi.org/10.24943/9788195648573.
Pełny tekst źródłaSánchez, José Miguel, Ricardo Sanhueza i Leonardo S. Letelier. Autonomía de las instituciones gubernamentales de Chile. Inter-American Development Bank, październik 1998. http://dx.doi.org/10.18235/0012006.
Pełny tekst źródłaBayona Ramírez, Edgar Antonio, Julián Mateo Hernández Cavadia, Dana Valentina Carantón Nocua i Luis Eduardo Rojas Avellaneda. Diseño de tostadora de cacao. Escuela Tecnológica Instituto Técnico Central, 2023. http://dx.doi.org/10.55411/2023.17.
Pełny tekst źródłaSaavedra, José Jorge. Compete Caribbean Update. Inter-American Development Bank, wrzesień 2011. http://dx.doi.org/10.18235/0006929.
Pełny tekst źródłaPinzón Candelario, Fanny. La interpretación ambiental como estrategia en educación ambiental con escolares de básica primaria del municipio de Leticia (Amazonas) en la reserva Agape. Universidad Nacional Abierta y a Distancia, lipiec 2021. http://dx.doi.org/10.22490/ecapma.4232.
Pełny tekst źródła