Academic literature on the topic 'Graphes médians'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Graphes médians.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Journal articles on the topic "Graphes médians"
Pecolo, Agnès. "Médias et âges de la vie." Le sociographe 35, no. 2 (2011): 21. http://dx.doi.org/10.3917/graph.035.0021.
Full textPouliot, Louise. "Les médias de masse sont-ils responsables des suicides en grappes ?" Intervention 21, no. 1 (September 1, 2009): 120–25. http://dx.doi.org/10.7202/037882ar.
Full textBaray, Jérôme, Gérard Cliquet, and Yves Soulabail. "Communautés thématiques et image des groupes de la grande distribution française dans les médias." Vie & sciences de l'entreprise N° 216-217, no. 1 (August 21, 2023): 313–23. http://dx.doi.org/10.3917/vse.216.0313.
Full textFrança, Iara Soares de, and Beatriz Ribeiro Soares. "Rede urbana regional, cidades médias e centralidades: estudo de Montes Claros e dos centros emergentes de Pirapora, Janaúba e Januária no Norte de Minas Gerais." Revista Brasileira de Estudos Urbanos e Regionais 14, no. 2 (November 30, 2012): 169. http://dx.doi.org/10.22296/2317-1529.2012v14n2p169.
Full textSantana, Maristênio Alves, Vitorio Antonio Pereira De Souza, Miryan Franciele Pereira Serpa, Alex Aguiar Ledo, and Arianna Santana De Menezes. "EFEITO DE DOSES DE ADUBAÇÃO ORGÂNICA NA PRODUÇÃO DE PALMA FORRAGEIRA." Nativa 9, no. 2 (May 14, 2021): 167–72. http://dx.doi.org/10.31413/nativa.v9i2.10655.
Full textAndrade, Daniela Da Silva, Mairon Moura da Silva, Cássio Lopes Oliveira, Patrícia Coelho de Souza Leão, Felipe Carvalheira Correia, Antonio Celso Dantas Antonino, Maria Fernanda De Albuquerque Tenório Alves, Márcio Henrique Leal Lopes, and José Romualdo De Sousa Lima. "Evapotranspiração, coeficiente de cultivo e eficiência no uso de água de uvas viníferas cultivadas no Agreste Pernambucano." Revista Brasileira de Geografia Física 16, no. 3 (June 1, 2023): 1376. http://dx.doi.org/10.26848/rbgf.v16.3.p1376-1386.
Full textKodjo, Yawo, Jean-Robert Rwenge Mburano, and Hamidou Kone. "Utilisation des Services Obstétricaux Modernes au Togo: Approche par les Modèles Mixtes." European Scientific Journal, ESJ 18, no. 40 (December 31, 2022): 10. http://dx.doi.org/10.19044/esj.2022.v18n40p10.
Full textCardoso, Brayna, and Regina Célia Fernandes Cruz. "ANÁLISE SOCIOFONÉTICA DO PORTUGUÊS FALADO EM SÃO LUÍS/MA COM BASE EM DADOS AMPER | SOCIOPHONETIC ANALYSIS OF PORTUGUESE SPOKEN IN SÃO LUÍS / MA BASED ON AMPER DATA." Estudos Linguísticos e Literários, no. 63 (October 3, 2019): 24. http://dx.doi.org/10.9771/ell.v0i63.33763.
Full textGomes, Guilherme Renato, and Kaio Batista Masironi. "Perfil dos Agricultores Paranaenses Quanto às suas Práticas de Manejo de Pragas e Doenças." UNICIÊNCIAS 27, no. 2 (December 13, 2023): 114–21. http://dx.doi.org/10.17921/1415-5141.2023v27n2p114-121.
Full textDíaz, Diego, and Clara Boj. "Prácticas artísticas en la época del dataceno. Data Biography: rastros digitales para la exploración biográfica de la identidad personal." Artnodes, no. 24 (July 17, 2019): 121–33. http://dx.doi.org/10.7238/a.v0i24.3293.
Full textDissertations / Theses on the topic "Graphes médians"
Bénéteau, Laurine. "Médians de graphes : algorithmes, connexité et axiomatique." Electronic Thesis or Diss., Aix-Marseille, 2022. http://www.theses.fr/2022AIXM0512.
Full textThe 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
Janaqi, Stefan. "Quelques éléments de la géométrie des graphes : graphes médians, produits d'arbres, génération convexe des graphes de Polymino." Université Joseph Fourier (Grenoble), 1994. http://www.theses.fr/1995GRE10093.
Full textTrad, Riadh. "Découverte d'évènements par contenu visuel dans les médias sociaux." Thesis, Paris, ENST, 2013. http://www.theses.fr/2013ENST0030/document.
Full textThe ease of publishing content on social media sites brings to the Web an ever increasing amount of user generated content captured during, and associated with, real life events. Social media documents shared by users often reflect their personal experience of the event. Hence, an event can be seen as a set of personal and local views, recorded by different users. These event records are likely to exhibit similar facets of the event but also specific aspects. By linking different records of the same event occurrence we can enable rich search and browsing of social media events content. Specifically, linking all the occurrences of the same event would provide a general overview of the event. In this dissertation we present a content-based approach for leveraging the wealth of social media documents available on the Web for event identification and characterization. To match event occurrences in social media, we develop a new visual-based method for retrieving events in huge photocollections, typically in the context of User Generated Content. The main contributions of the thesis are the following : (1) a new visual-based method for retrieving events in photo collections, (2) a scalable and distributed framework for Nearest Neighbors Graph construction for high dimensional data, (3) a collaborative content-based filtering technique for selecting relevant social media documents for a given event
Trad, Riadh. "Découverte d'évènements par contenu visuel dans les médias sociaux." Electronic Thesis or Diss., Paris, ENST, 2013. http://www.theses.fr/2013ENST0030.
Full textThe ease of publishing content on social media sites brings to the Web an ever increasing amount of user generated content captured during, and associated with, real life events. Social media documents shared by users often reflect their personal experience of the event. Hence, an event can be seen as a set of personal and local views, recorded by different users. These event records are likely to exhibit similar facets of the event but also specific aspects. By linking different records of the same event occurrence we can enable rich search and browsing of social media events content. Specifically, linking all the occurrences of the same event would provide a general overview of the event. In this dissertation we present a content-based approach for leveraging the wealth of social media documents available on the Web for event identification and characterization. To match event occurrences in social media, we develop a new visual-based method for retrieving events in huge photocollections, typically in the context of User Generated Content. The main contributions of the thesis are the following : (1) a new visual-based method for retrieving events in photo collections, (2) a scalable and distributed framework for Nearest Neighbors Graph construction for high dimensional data, (3) a collaborative content-based filtering technique for selecting relevant social media documents for a given event
Balalau, Oana. "Recherche de sous-graphes denses et d'événements dans les médias sociaux." Electronic Thesis or Diss., Paris, ENST, 2017. http://www.theses.fr/2017ENST0020.
Full textEvent detection in social media is the task of finding mentions of real-world events in collections of posts. The motivation behind our work is two-folded: first, finding events that are not covered by mainstream media and second, studying the interest that users show for certain types of events. In order to solve our problem, we start from a graph based characterization of the data in which nodes represent words and edges count word co-occurrences. Density is a very good measure of importance and cohesiveness in graphs. Taking into account the special properties of real-word networks, we can develop algorithms that efficiently solve hard problems. The contributions of this thesis are: devising efficient algorithms for computing different types of dense subgraphs in real-world graphs, presenting a novel dense subgraph definition and providing an efficient graph-based algorithm for event detection
Gadek, Guillaume. "Détection d'opinions, d'acteurs-clés et de communautés thématiques dans les médias sociaux." Thesis, Normandie, 2018. http://www.theses.fr/2018NORMIR18/document.
Full textOnline Social Networks have taken a huge place in the informational space and are often used for advertising, e-reputation, propaganda, or even manipulation, either by individuals, companies or states. The amount of information makes difficult the human exploitation, while the need for social network analysis remains unsatisfied: trends must be extracted from the posted messages, the user behaviours must be characterised, and the social structure must be identified. To tackle this problem, we propose a system providing analysis tools on three levels. First, the message analysis aims to determine the opinions they bear. Then, the characterisation and evaluation of user accounts is performed thanks to the union of a behavioural profiling method, the study of node importance and position in social graphs and engagement and influence measures. Finally the step of user community detection and evaluation is accomplished. For this last challenge, we introduce thematic cohesion scores, completing the topological, graph-based measures for group quality. This system is then applied on two corpora, extracted from two different online social media. The first is constituted of messages published on Twitter, gathering every activity performed by a set of 5,000 accounts on a long period. The second stems from a ToR-based social network, named Galaxy2, and includes every public action performed on the platform during its uptime. We evaluate the relevance of our system on these two datasets, showing the complementarity of user account characterisation tools (influence, behaviour and role), and user account communities (interaction strength, thematic cohesion), enriching the social graph exploitation with textual content elements
Montanvert, Annick. "Contribution au traitement de formes discrètes : squelettes et codage par graphe de la ligne médiane." Phd thesis, Grenoble INPG, 1987. http://tel.archives-ouvertes.fr/tel-00325209.
Full textRen, Haolin. "Visualizing media with interactive multiplex networks." Thesis, Bordeaux, 2019. http://www.theses.fr/2019BORD0036/document.
Full textNowadays, 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
Ratel, Sébastien. "Densité, VC-dimension et étiquetages de graphes." Electronic Thesis or Diss., Aix-Marseille, 2019. http://www.theses.fr/2019AIXM0427.
Full textConstructing 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
Allard, Antoine. "Percolation sur graphes aléatoires - modélisation et description analytique -." Thesis, Université Laval, 2014. http://www.theses.ulaval.ca/2014/30822/30822.pdf.
Full textGraphs are abstract mathematical objects used to model the interactions between the elements of complex systems. Their use is motivated by the fact that there exists a fundamental relationship between the structure of these interactions and the macroscopic properties of these systems. The structure of these graphs is analyzed within the paradigm of percolation theory whose tools and concepts contribute to a better understanding of the conditions for which these emergent properties appear. The underlying interactions of a wide variety of complex systems share many universal structural properties, and including these properties in a unified theoretical framework is one of the main challenges of the science of complex systems. Capitalizing on a multitype approach, a simple yet powerful idea, we have unified the models of percolation on random graphs published to this day in a single framework, hence yielding the most general and realistic framework to date. More than a mere compilation, this framework significantly increases the structural complexity of the graphs that can now be mathematically handled, and, as such, opens the way to many new research opportunities. We illustrate this assertion by using our framework to validate hypotheses hinted at by empirical results. First, we investigate how the network structure of some complex systems (e.g., power grids, social networks) enhances our ability to monitor them, and ultimately to control them. Second, we test the hypothesis that the “k-core” decomposition can act as an effective structure of graphs extracted from real complex systems. Third, we use our framework to identify the conditions for which a new immunization strategy against infectious diseases is optimal.
Books on the topic "Graphes médians"
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.
Find full textLiam, O'Donnell. Media meltdown: A graphic guide adventure. Victoria, BC, Canada: Orca Book Publishers, 2009.
Find full textYust, Larry, and McLuhan Marshall. The book of probes: Marshall McLuhan, David Carson. Corte Madera, CA: Gingko Press, 2003.
Find full textGraphic Violence. Taylor & Francis Group, 2019.
Find full textNorth Korean Graphic Novels. Taylor & Francis Group, 2018.
Find full textEdwards, Emily. Graphic Violence: Illustrated Theories about Violence, Popular Media, and Our Social Lives. Taylor & Francis Group, 2019.
Find full textEdwards, Emily. Graphic Violence: Illustrated Theories about Violence, Popular Media, and Our Social Lives. Taylor & Francis Group, 2019.
Find full textEdwards, Emily. Graphic Violence: Illustrated Theories about Violence, Popular Media, and Our Social Lives. Taylor & Francis Group, 2019.
Find full textPetersen, Martin. North Korean Graphic Novels: Seduction of the Innocent? Taylor & Francis Group, 2018.
Find full textPetersen, Martin. North Korean Graphic Novels: Seduction of the Innocent? Taylor & Francis Group, 2018.
Find full textBook chapters on the topic "Graphes médians"
Freedman, Ariela. "Empathy, Irony, and Humanitarian Witness in The Photographer." In Making Humanitarian Crises, 127–45. Cham: Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-031-00824-5_6.
Full textMoraes, Francisca Pereira de, Mayk dos Santos, Danilo Bento Santana, Débora Coutinho Italiano, and Alisson Marcel Souza de Oliveira. "CARACTERÍSTICAS FÍSICO-QUÍMICAS DE FRUTOS DE TOMATE-CEREJA PRODUZIDOS NO ALTO SERTÃO SERGIPANO." In Agroindústria 4.0: oportunidades e desafios, 92–108. Instituto Internacional Despertando Vocações, 2024. http://dx.doi.org/10.31692/978-65-88970-43-0.92-108.
Full textMagalhães, Guilherme Gomes de Sousa, Leonardo César da Silva, Liliana Andréa dos Santos, Tatiana Souza Porto, and André Felipe de Melo Sales Santos. "PRODUÇÃO DE BIOGÁS A PARTIR DO BAGAÇO DE UVA: ANÁLISE BIBLIOMÉTRICA." In Agroindústria 4.0: oportunidades e desafios, 710–31. Instituto Internacional Despertando Vocações, 2024. http://dx.doi.org/10.31692/978-65-88970-43-0.710-731.
Full textConference papers on the topic "Graphes médians"
Rajna, Franciska. "A kommunikációs gráfok és a fekete-fehér SAT probléma közti összefüggések vizsgálata." In Agria Média 2020 : „Az oktatás digitális átállása korunk pedagógiai forradalma”. Eszterházy Károly Egyetem Líceum Kiadó, 2021. http://dx.doi.org/10.17048/am.2020.321.
Full textFonseca, Flávia Massaro, and Simone Helena Tanoue Vizioli. "Os desenhos de Villard de Honnecourt e o processo projetivo na Idade Média." In XVIII Conference of the Iberoamerican Society of Digital Graphics - SIGraDi: Design in Freedom. São Paulo: Editora Edgard Blücher, 2014. http://dx.doi.org/10.5151/despro-sigradi2014-0097.
Full textOlivo, Regis Yuri, Pedro Luiz De Paula Filho, and Arnaldo Candido Junior. "Uma abordagem neural na identificação de objetos em imagens para auxilio na manutencão de rede elétrica." In Conference on Graphics, Patterns and Images. Sociedade Brasileira de Computação, 2020. http://dx.doi.org/10.5753/sibgrapi.est.2020.13006.
Full textDe Cesaro Júnior, Telmo, and Rafael Rieder. "Uma Implementação Baseada em Mask R-CNN para Detecção de Insetos em Imagens Digitais." In Conference on Graphics, Patterns and Images. Sociedade Brasileira de Computação, 2020. http://dx.doi.org/10.5753/sibgrapi.est.2020.12996.
Full textSantos, Milena L. dos, Claudio R. M. Mauricio, Valéria N. dos Santos, and Fabiana F. F. Peres. "Rede Neural Convolucional para Detecção de Pedestres Realizando Travessias de Risco." In Anais Estendidos da Conference on Graphics, Patterns and Images. Sociedade Brasileira de Computação - SBC, 2022. http://dx.doi.org/10.5753/sibgrapi.est.2022.23276.
Full textCANTUÁRIO, VINICIUS LUIS DE OLIVEIRA, FRANCILIO DE CARVALHO OLIVEIRA, JANCINEIDE OLIVEIRA DE CARVALHO, GUILHERME DE CASTRO BRITO, and ANDERSON OLIVEIRA LOBO. "BIOMATERIAIS HÍBRIDOS A BASE DE CERÂMICOS." In II Brazilian Congress of Development. DEV2021, 2021. http://dx.doi.org/10.51162/brc.dev2021-0022.
Full textAlmeida, Fernando Líbio Leite, Alberto F. De Souza, and Edil S. T. Fernandes. "DTSD: Uma Arquitetura com Mecanismo Híbrido de Execução." In Simpósio em Sistemas Computacionais de Alto Desempenho. Sociedade Brasileira de Computação, 2008. http://dx.doi.org/10.5753/wscad.2008.17666.
Full text