Literatura científica selecionada sobre o tema "Représentation des graphes"
Crie uma referência precisa em APA, MLA, Chicago, Harvard, e outros estilos
Índice
Consulte a lista de atuais artigos, livros, teses, anais de congressos e outras fontes científicas relevantes para o tema "Représentation des graphes".
Ao lado de cada fonte na lista de referências, há um botão "Adicionar à bibliografia". Clique e geraremos automaticamente a citação bibliográfica do trabalho escolhido no estilo de citação de que você precisa: APA, MLA, Harvard, Chicago, Vancouver, etc.
Você também pode baixar o texto completo da publicação científica em formato .pdf e ler o resumo do trabalho online se estiver presente nos metadados.
Artigos de revistas sobre o assunto "Représentation des graphes"
Cottenceau, Bertrand, Laurent Hardouin e Euriell Le Corronc. "Représentation tridimensionnelle de la dynamique des graphes d'événements temporisés généralisés". Journal Européen des Systèmes Automatisés 43, n.º 7-9 (10 de novembro de 2009): 1081–85. http://dx.doi.org/10.3166/jesa.43.1081-1085.
Texto completo da fonteGarcia-Debanc, Claudine, Myriam Bras e Laure Vieu. "Annotation de la cohérence dans des textes d’élèves et jugements de cohérence d’enseignants du primaire". SHS Web of Conferences 186 (2024): 03003. http://dx.doi.org/10.1051/shsconf/202418603003.
Texto completo da fontePham, Minh Tan, Grégoire Mercier e Julien Michel. "Textural features from wavelets on graphs for very high resolution panchromatic Pléiades image classification". Revue Française de Photogrammétrie et de Télédétection, n.º 208 (5 de setembro de 2014): 131–36. http://dx.doi.org/10.52638/rfpt.2014.91.
Texto completo da fonteKatalenić, Ana, Aleksandra Čižmešija e Željka Milin Šipuš. "Asymptote in prospective mathematics teachers’ graphing praxeologiesAsymptote dans les praxéologies graphiques des futurs professeurs de mathématiques". Educação Matemática Pesquisa : Revista do Programa de Estudos Pós-Graduados em Educação Matemática 22, n.º 4 (15 de setembro de 2020): 817–26. http://dx.doi.org/10.23925/1983-3156.2020v22i4p817-826.
Texto completo da fonteKatalenić, Ana, Aleksandra Čižmešija e Željka Milin Šipuš. "Asymptote in prospective mathematics teachers’ graphing praxeologiesAsymptote dans les praxéologies graphiques des futurs professeurs de mathématiques". Educação Matemática Pesquisa : Revista do Programa de Estudos Pós-Graduados em Educação Matemática 22, n.º 4 (15 de setembro de 2020): 817–26. http://dx.doi.org/10.23925/1983-3156.2020v22i4p817-826.
Texto completo da fonteWang, Peng, Véronique Eglin, Christine Largeron, Christophe Garcia, Josep Llados e Alicia Fornés. "Représentation des mots manuscrits par graphe pour la recherche par similarité". Document numérique 17, n.º 3 (30 de dezembro de 2014): 53–75. http://dx.doi.org/10.3166/dn.17.3.53-75.
Texto completo da fonteBadir, Sémir, e Stéphane Polis. "Les cartes sémantiques en typologie des langues. La médiation iconique entre qualification et quantification dans des représentations visuelles du discours linguistique". Travaux de linguistique 87, n.º 2 (10 de janeiro de 2024): 51–73. http://dx.doi.org/10.3917/tl.087.0051.
Texto completo da fonteVilla-Vialanex, Nathalie. "Recherche et représentation de communautés dans un grand graphe. Une approche combinée". Document numérique 14, n.º 1 (30 de abril de 2010): 59–80. http://dx.doi.org/10.3166/dn.14.1.59-80.
Texto completo da fonteMésangeau, Julien. "Articuler graphes et représentations d’utilisateurs d’un réseau socionumérique : retours sur une méthodologie d’entretien". Sciences de la société, n.º 92 (1 de dezembro de 2014): 143–59. http://dx.doi.org/10.4000/sds.1172.
Texto completo da fonteLecouvey, Cédric, e Pierre Tarrago. "Mesures centrales pour les graphes multiplicatifs, représentations d’algèbres de Lie et polytopes des poids". Annales de l'Institut Fourier 70, n.º 6 (15 de abril de 2021): 2361–407. http://dx.doi.org/10.5802/aif.3350.
Texto completo da fonteTeses / dissertações sobre o assunto "Représentation des graphes"
Picard, Celia. "Représentation coinductive des graphes". Phd thesis, Université Paul Sabatier - Toulouse III, 2012. http://tel.archives-ouvertes.fr/tel-00862507.
Texto completo da fonteLabourel, Arnaud. "Partition d'arêts et représentation implicite de graphes". Bordeaux 1, 2007. http://www.theses.fr/2007BOR13490.
Texto completo da fonteKerdiles, Gwenael Nang. "Logiques de graphes conceptuels". Montpellier 2, 2001. http://www.theses.fr/2001MON20185.
Texto completo da fonteBoschin, Armand. "Machine learning techniques for automatic knowledge graph completion". Electronic Thesis or Diss., Institut polytechnique de Paris, 2023. http://www.theses.fr/2023IPPAT016.
Texto completo da fonteA knowledge graph is a directed graph in which nodes are entities and edges, typed by a relation, represent known facts linking two entities. These graphs can encode a wide variety of information, but their construction and exploitation can be complex. Historically, symbolic methods have been used to extract rules about entities and relations, to correct anomalies or to predict missing facts. More recently, techniques of representation learning, or embeddings, have attempted to solve these same tasks. Initially purely algebraic or geometric, these methods have become more complex with deep neural networks and have sometimes been combined with pre-existing symbolic techniques.In this thesis, we first focus on the problem of implementation. Indeed, the diversity of libraries used makes the comparison of results obtained by different models a complex task. In this context, the Python library TorchKGE was developed to provide a unique setup for the implementation of embedding models and a highly efficient inference evaluation module. This library relies on graphic acceleration of tensor computation provided by PyTorch, is compatible with widespread optimization libraries and is available as open source.We then consider the automatic enrichment of Wikidata by typing the hyperlinks linking Wikipedia pages. A preliminary study showed that the graph of Wikipedia articles is much denser than the corresponding knowledge graph in Wikidata. A new training method involving relations and an inference method using entity types were proposed and experiments showed the relevance of the combined approach, including on a new dataset.Finally, we explore automatic entity typing as a hierarchical classification task. That led to the design of a new hierarchical loss used to train tensor-based models along with a new type of encoder. Experiments on two datasets have allowed a good understanding of the impact a prior knowledge of class taxonomy can have on a classifier but also reinforced the intuition that the hierarchy can be learned from the features if the dataset is large enough
Faci, Adam. "Représentation, simulation et exploitation de connaissances dans le formalisme des graphes conceptuels". Electronic Thesis or Diss., Sorbonne université, 2022. http://www.theses.fr/2022SORUS419.
Texto completo da fonteThis thesis addresses the field of knowledge representation in conceptual graphs, a structured knowledge representation formalism that provides efficient manipulation tools. There are many challenges in symbolic artificial intelligence concerning the representation of knowledge in general, and in particular the concise representation of a large amount of information. Conceptual graphs, by their ability to visually represent different kinds of knowledge, mainly ontological and factual, and by offering efficient manipulation tools, provide a perfect framework for the answer to these problems. We conduct a comparative study of fuzzy extensions of conceptual graphs, then we propose an algorithm for conceptual graphs simulation as well as an efficient algorithm for extracting frequent patterns that are not redundant with ontological knowledge
Ghilardi, Jean-Pierre. "Optimisation de la représentation de graphes par approche hybride déterministe et stochastique". Aix-Marseille 3, 2002. http://www.theses.fr/2002AIX30032.
Texto completo da fonteIn bibliometrie scope, we frequently have to compute database which constitute a quantitive information corpus, difficult to interpret by direct reading. That's the reason why some tools with complex mathematic treatments have been created, this is how structured data bank can be processing to obtain relevant information available for decision makers. The Centre de Recherche Rétrospective de Marseille is specialized in information processing for a long time. Automatic tools based on geometrical representation of relationship between entities have been developed. During this research, an innovant data processing implemented to automatically produce an organized representation of graph easily understandable have been defined. The treatment chain is based on two different approach, a determinist approach issuing from graph theory and a stochastic approach composed of simulated annealing algorithm and genetic algorithm, which allow to make easier graph reading
Hafidi, Hakim. "Robust machine learning for Graphs/Networks". Electronic Thesis or Diss., Institut polytechnique de Paris, 2023. http://www.theses.fr/2023IPPAT004.
Texto completo da fonteThis thesis addresses advancements in graph representation learning, focusing on the challengesand opportunities presented by Graph Neural Networks (GNNs). It highlights the significanceof graphs in representing complex systems and the necessity of learning node embeddings that capture both node features and graph structure. The study identifies key issues in GNNs, such as their dependence on high-quality labeled data, inconsistent performanceacross various datasets, and susceptibility to adversarial attacks.To tackle these challenges, the thesis introduces several innovative approaches. Firstly, it employs contrastive learning for node representation, enabling self-supervised learning that reduces reliance on labeled data. Secondly, a Bayesian-based classifier isproposed for node classification, which considers the graph’s structure to enhance accuracy. Lastly, the thesis addresses the vulnerability of GNNs to adversarialattacks by assessing the robustness of the proposed classifier and introducing effective defense mechanisms.These contributions aim to improve both the performance and resilience of GNNs in graph representation learning
Melki, Michaël. "Etude d'un modèle de représentation symbolique multi-résolution d'une image à base de graphes". Lyon, INSA, 2006. http://theses.insa-lyon.fr/publication/2006ISAL0074/these.pdf.
Texto completo da fonteIn this PhD, we present a symbolic, multi-resolution model for representing an image. To do that, we consider both the structure of the image, that is the blocs from which it is constituted, and its content. We first focus on the structural part of the image. Under some constraints, a few properties can be enough to fully characterize the topology of the structure. This leads us to a graph-based representation for the structure of an image, which can be completed by adding symbolic information to the nodes to represent the content part of the image. We then propose a process to build an lower resolution image from an input image. This process uses reduction rules that take into account both the structure and the content of the image, and could be used either to segment an image at different resolution levels or to extract some information from it. Then we study this process to define methods that can be used for learning some of the parameters of the rules, for speeding up the building process, or for making the whole process more reliable
Guinaldo, Olivier. "Etude d'un gestionnaire d'ensembles de graphes conceptuels". Montpellier 2, 1996. http://www.theses.fr/1996MON20189.
Texto completo da fonteCarbonneill, Boris. "Vers un système de représentation de connaissances et de raisonnement fondé sur les graphes conceptuels". Montpellier 2, 1996. http://www.theses.fr/1996MON20015.
Texto completo da fonteLivros sobre o assunto "Représentation des graphes"
T, Henry Gary, e American Evaluation Association, eds. Creating effective graphs: Solutions for a variety of evaluation data. San Franciso, Calif: Jossey-Bass Publishers, 1997.
Encontre o texto completo da fonteLedoux, Michel. Multicultural Canada : a graphic overview =: Un Canada multiculturel : représentation graphique. Ottawa, Ont: Multiculturalism and Citizenship Canada = Multiculturalisme et citoyenneté Canada, 1990.
Encontre o texto completo da fontePascal, Hitzler, e Schärfe Henrik, eds. Conceptual structures in practice. Boca Raton, Fla: Taylor & Francis, 2009.
Encontre o texto completo da fonteTufte, Edward R. Envisioning information. Cheshire, Conn: Graphics Press, 1990.
Encontre o texto completo da fonteTufte, Edward R. Envisioning Information. Cheshire, Conn. (P.O. Box 430, Cheshire 06410): Graphics Press, 1990.
Encontre o texto completo da fonteTufte, Edward R. Envisioning information. 8a ed. Cheshire, Conn: Graphics Press, 2001.
Encontre o texto completo da fonteTufte, Edward R. Envisioning information. Cheshire, USA: Graphics Press, 1992.
Encontre o texto completo da fonteGraphing Calculator Activities. IPMG Publishing, 2009.
Encontre o texto completo da fonteGraphing Calculator Activities: Exploring Topics in Precalculus. Addison-Wesley, 1994.
Encontre o texto completo da fonteHitzler, Pascal, e Henrik Scharfe. Conceptual Structures in Practice. Taylor & Francis Group, 2009.
Encontre o texto completo da fonteCapítulos de livros sobre o assunto "Représentation des graphes"
"1. La représentation visuelle dans les pratiques pyro-ostéomantiques dans la Chine Archaïque". In Graphics and Text in the Production of Technical Knowledge in China, 81–107. BRILL, 2007. http://dx.doi.org/10.1163/ej.9789004160637.i-772.12.
Texto completo da fonteTrabalhos de conferências sobre o assunto "Représentation des graphes"
Ghoniem, Mohammad, Jean-Daniel Fekete e Philippe Castagliola. "Comparaison de la lisibilité des graphes en représentation noeuds-liens et matricielle". In the 16th conference. New York, New York, USA: ACM Press, 2004. http://dx.doi.org/10.1145/1148613.1148625.
Texto completo da fonte