Literatura científica selecionada sobre o tema "Construction de 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 "Construction de 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 "Construction de graphes"
Díaz Villalba, Alejandro. "Comment outiller l’étude des autorités avec l’analyse de réseaux dans les grammaires françaises des XVIe et XVIIe siècles". SHS Web of Conferences 138 (2022): 03003. http://dx.doi.org/10.1051/shsconf/202213803003.
Texto completo da fontePigeon, Émilie. "Réseaux sociaux catholiques et construction identitaire dans les Pays d’en haut : l’exemple du fort Michilimackinac (1741-1821)". Francophonies d'Amérique, n.º 40-41 (8 de março de 2018): 83–112. http://dx.doi.org/10.7202/1043699ar.
Texto completo da fonteCHABI, Tayeb. "Identification des scenarios à la performance de l’entreprise par la productivité, rentabilité et compétitivité suivant le modèle Morphol : Cas d’un échantillon d’entreprise." Dirassat Journal Economic Issue 6, n.º 1 (1 de janeiro de 2015): 291–307. http://dx.doi.org/10.34118/djei.v6i1.547.
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 fonteAntalan, John Rafael Macalisang, e Francis Joseph Campena. "A Breadth-first Search Tree Construction for Multiplicative Circulant Graphs". European Journal of Pure and Applied Mathematics 14, n.º 1 (31 de janeiro de 2021): 248–64. http://dx.doi.org/10.29020/nybg.ejpam.v14i1.3884.
Texto completo da fonteHALPERN, M. B., e N. A. OBERS. "NEW SUPERCONFORMAL CONSTRUCTIONS ON TRIANGLE-FREE GRAPHS". International Journal of Modern Physics A 07, n.º 29 (20 de novembro de 1992): 7263–86. http://dx.doi.org/10.1142/s0217751x92003331.
Texto completo da fonteAkwu, A. D. "On Strongly Sum Difference Quotient Labeling of One-Point Union of Graphs, Chain and Corona Graphs". Annals of the Alexandru Ioan Cuza University - Mathematics 61, n.º 1 (1 de janeiro de 2015): 101–8. http://dx.doi.org/10.2478/aicu-2014-0026.
Texto completo da fonteLorenzen, Kate. "Cospectral constructions for several graph matrices using cousin vertices". Special Matrices 10, n.º 1 (28 de junho de 2021): 9–22. http://dx.doi.org/10.1515/spma-2020-0143.
Texto completo da fonteRegonati, F., e N. Zagaglia Salvi. "Some constructions of $\lambda$-minimal graphs". Czechoslovak Mathematical Journal 44, n.º 2 (1994): 315–23. http://dx.doi.org/10.21136/cmj.1994.128459.
Texto completo da fonteHaythorpe, M., e A. Newcombe. "Constructing families of cospectral regular graphs". Combinatorics, Probability and Computing 29, n.º 5 (30 de junho de 2020): 664–71. http://dx.doi.org/10.1017/s096354832000019x.
Texto completo da fonteTeses / dissertações sobre o assunto "Construction de graphes"
Barakat-Barbieri, Bruno. "Vers une construction automatique de graphes de concepts". Châtenay-Malabry, Ecole centrale de Paris, 1992. http://www.theses.fr/1992ECAP0416.
Texto completo da fonteBricage, Marie. "Modélisation et Algorithmique de graphes pour la construction de structures moléculaires". Thesis, Université Paris-Saclay (ComUE), 2018. http://www.theses.fr/2018SACLV031/document.
Texto completo da fonteIn this thesis, we present an algorithmic approach allowing the generation of construction guides of organic molecular cages. These semi-molecular architectures have a defined internal space capable of trapping a target molecule called substrate. Many works propose to generate molecular organic cages obtained from symmetrical structures, which have a good complexity, but they are not specific because they do not take into account precise targets. The proposed approach makes it possible to generate guides for the construction of organic molecular cages specific to a given substrate. In order to ensure the specificity of the molecular cage for the target substrate, an intermediate structure, which is an expansion of the envelope of the target substrate, is used. This structure defines the shape of the space in which the substrate is trapped. Small sets of atoms, called molecular binding patterns, are then integrated into this intermediate structure. These molecular patterns are the sets of atoms needed by molecular cages to allow them to interact with the substrate to capture it
Bloyet, Nicolas. "Caractérisation et plongement de sous-graphes colorés : application à la construction de modèles structures à activité (QSAR)". Thesis, Lorient, 2019. http://www.theses.fr/2019LORIS546.
Texto completo da fonteIn the field of chemistry, it is interesting to be able to estimate the physicochemical properties of molecules, especially for industrial applications. These are difficult to estimate by physical simulations, as their implementation often present prohibitive time complexity. However, the emergence of data (public or private) opens new perspectives for the treatment of these problems by statistical methods and machine learning. The main difficulty lies in the characterization of molecules: these are more like a network of atoms (in other words a colored graph) than a vector. Unfortunately, statistical modeling methods usually deal with observations encoded as such, hence the need for specific methods able to deal with graphs- encoded observations, called structure-activity relationships. The aim of this thesis is to take advantage of public corpora to learn the best possible representations of these structures, and to transfer this global knowledge to smaller datasets. We adapted methods used in automatic processing of natural languages to achieve this goal. To implement them, more theoretical work was needed, especially on the graph isomorphism problem. The results obtained on classification / regression tasks are at least competitive with the state of the art, and even sometimes better, in particular on restricted data sets, attesting some opportunities for transfer learning in this field
Said, Bilal. "Réécriture de graphes pour la construction de modèles en logique modale". Phd thesis, Université Paul Sabatier - Toulouse III, 2010. http://tel.archives-ouvertes.fr/tel-00466115.
Texto completo da fonteJin, Xiong. "Construction et analyse multifractale de fonctions aléatoires et de leurs graphes". Phd thesis, Université Paris Sud - Paris XI, 2010. http://tel.archives-ouvertes.fr/tel-00841501.
Texto completo da fonteAndriyanova, Iryna. "Etude d'une certaine construction des codes definis par les graphes: codes TLDPC". Phd thesis, Télécom ParisTech, 2006. http://pastel.archives-ouvertes.fr/pastel-00002465.
Texto completo da fonteLoi, Michel. "Outils pour la construction de graphes de tâches acycliques à gros grain". Lyon 1, 1996. http://www.theses.fr/1996LYO10260.
Texto completo da fonteAndriyanova, Iryna. "Etude d'une certaine construction des codes définis par les graphes : codes TLDPC". Paris, ENST, 2006. http://www.theses.fr/2006ENST0042.
Texto completo da fonteThis study is dedicated to the analysis and the design of sparse-graph codes in order to construct codes having high performances both in waterfall and error-floor regions under an iterative decoding algorithm of low complexity. In particular, we explore a class of Tail-biting trellis LDPC (TLDPC) codes involving the class of turbo codes of Berrou and Glavieux as well as the class of codes of Gallager known as LDPC codes. In the first part of the thesis, binary TLDPC codes are investigated. We found sufficient and necessary conditions to ensure that they are asymptotically good by calculating their average weight enumerator and studying a certain graph in which the cycles correspond to potentially low weight codewords. These conditions give us an upper bound on the fraction of degree-2 nodes in the Tanner graph. By keeping the fraction of degree-2 nodes below the upper bound, we optimised the degree distribution of other variable nodes by EXIT chart techniques and thus we obtained good performances under standard iterative decoding algorithm (belief propagation). In the second part of the thesis, some non-binary TLDPC and LDPC codes are investigated. We propose a family of non-binary TLDPC codes with a very simple structure and a steep waterfall region. We also noticed that any LDPC code with at least two degree-2 symbols per parity-check equation can be represented as a TLDPC code with symbols in degree 1 in its structure. Thus, it can be decoded like a TLDPC code. In the case of cycle codes, such a decoding decreases significantly the number of iterations while the iterative decoding threshold does not seem to change. Moreover, by allowing a constant fraction of degree 1 symbols for this class of codes and a small fraction of erased bits after decoding over binary erasure channel, we obtained codes with improved iterative decoding performances
Andriyanova, Iryna. "Étude d'une certaine construction des codes définis par les graphes : codes TLDPC /". Paris : École nationale supérieure des télécommunications, 2007. http://catalogue.bnf.fr/ark:/12148/cb41087138x.
Texto completo da fonteVonseel, Audrey. "Hyperbolicité et bouts des graphes de Schreier". Thesis, Strasbourg, 2017. http://www.theses.fr/2017STRAD025/document.
Texto completo da fonteThis thesis is devoted to the study of the topology at infinity of spaces generalizing Schreier graphs. More precisely, we consider the quotient X/H of a geodesic proper hyperbolic metric space X by a quasiconvex-cocompact group H of isometries of X. We show that this quotient is a hyperbolic space. The main result of the thesis indicates that the number of ends of the quotient space X/H is determined by equivalence classes on a sphere of computable radius. In the context of group theory, we show that one can construct explicitly groups and subgroups for which there are no algorithm to determine the number of relative ends. If the subgroup is quasiconvex, we give an algorithm to compute the number of relative ends
Livros sobre o assunto "Construction de graphes"
Guide des sciences et technologies industrielles: Dessin industriel et graphes, matériaux, éléments de construction ou de machines... [La Plaine-Saint-Denis]: AFNOR, 2004.
Encontre o texto completo da fonteIsakov, Vladimir. Speak the language of schemes. ru: INFRA-M Academic Publishing LLC., 2022. http://dx.doi.org/10.12737/1860649.
Texto completo da fonteD, Mahoney William, e R. S. Means Company, eds. Means graphic construction standards. Kingston, MA: R.S. Means Co., 1986.
Encontre o texto completo da fonteGraphic guide to frame construction. 3a ed. Newtown, CT: Taunton Press, 2009.
Encontre o texto completo da fonteKang, Kaffee. Graphic guide to frame construction. Upper Saddle River, N.J: Prentice Hall, 1998.
Encontre o texto completo da fontename, No. Architectural graphic standards for residential construction. New York, NY: John Wiley & Sons, 2002.
Encontre o texto completo da fonteArchitects, American Institute of, ed. Architectural graphic standards for residential construction. 2a ed. Hoboken, N.J: Wiley, 2010.
Encontre o texto completo da fonteJanet, Rumbarger, Vitullo Richard e Ramsey Charles George 1884-1963, eds. Architectural graphic standards for residential construction. New York: John Wiley & Sons, 2003.
Encontre o texto completo da fonte1893-1960, Sleeper Harold Reeve, Ambrose James E, Ramsey Charles George 1884-1963 e American Institute of Architects, eds. Construction details from Architectural graphic standards. New York: J. Wiley, 1992.
Encontre o texto completo da fonteM, Giglio Nina, ed. Graphic Standards Field Guide to Residential Construction. Hoboken, New Jersey: John Wiley & Sons, Inc., 2011.
Encontre o texto completo da fonteCapítulos de livros sobre o assunto "Construction de graphes"
Beneš, Nikola, Luboš Brim, Samuel Pastva e David Šafránek. "Symbolic Coloured SCC Decomposition". In Tools and Algorithms for the Construction and Analysis of Systems, 64–83. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-72013-1_4.
Texto completo da fonteMohan, Anshuman, Wei Xiang Leow e Aquinas Hobor. "Functional Correctness of C Implementations of Dijkstra’s, Kruskal’s, and Prim’s Algorithms". In Computer Aided Verification, 801–26. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-81688-9_37.
Texto completo da fonteHolzinger, Andreas, Anna Saranti, Anne-Christin Hauschild, Jacqueline Beinecke, Dominik Heider, Richard Roettger, Heimo Mueller, Jan Baumbach e Bastian Pfeifer. "Human-in-the-Loop Integration with Domain-Knowledge Graphs for Explainable Federated Deep Learning". In Lecture Notes in Computer Science, 45–64. Cham: Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-40837-3_4.
Texto completo da fonteWallgrün, Jan Oliver. "Simplification and Hierarchical Voronoi Graph Construction". In Hierarchical Voronoi Graphs, 59–84. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-10345-2_4.
Texto completo da fonteMitchell, Charles F. "Graphic Statics". In Building Construction and Drawing 1906, 396–426. 4a ed. London: Routledge, 2022. http://dx.doi.org/10.1201/9781003261674-8.
Texto completo da fonteLarsen, Casper Abild, Simon Meldahl Schmidt, Jesper Steensgaard, Anna Blume Jakobsen, Jaco van de Pol e Andreas Pavlogiannis. "A Truly Symbolic Linear-Time Algorithm for SCC Decomposition". In Tools and Algorithms for the Construction and Analysis of Systems, 353–71. Cham: Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-30820-8_22.
Texto completo da fonteMeyer, Roland, Thomas Wies e Sebastian Wolff. "Make Flows Small Again: Revisiting the Flow Framework". In Tools and Algorithms for the Construction and Analysis of Systems, 628–46. Cham: Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-30823-9_32.
Texto completo da fonteZohhadi, Nima, Nirupam Aich, Fabio Matta, Navid B. Saleh e Paul Ziehl. "Graphene Nanoreinforcement for Cement Composites". In Nanotechnology in Construction, 265–70. Cham: Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-17088-6_34.
Texto completo da fonteZhou, Xiang. "CFI Construction and Balanced Graphs". In Frontiers in Algorithmics, 97–107. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-02270-8_12.
Texto completo da fonteFraga López, Francisco Javier. "Detailed Knowledge of Territory: Construction and Army". In Graphic Horizons, 181–89. Cham: Springer Nature Switzerland, 2024. http://dx.doi.org/10.1007/978-3-031-57583-9_23.
Texto completo da fonteTrabalhos de conferências sobre o assunto "Construction de graphes"
Fu, Xiaoyi, Jie Zhang, Hao Yu, Jiachen Li, Dong Chen, Jie Yuan e Xindong Wu. "A Speech-to-Knowledge-Graph Construction System". In 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/777.
Texto completo da fonteShai, Offer. "Topological Synthesis of All 2D Mechanisms Through Assur Graphs". In ASME 2010 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. ASMEDC, 2010. http://dx.doi.org/10.1115/detc2010-28926.
Texto completo da fonteHahn, Elad, e Offer Shai. "Construction of Baranov Trusses Using a Single Universal Construction Rule". In ASME 2016 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. American Society of Mechanical Engineers, 2016. http://dx.doi.org/10.1115/detc2016-59134.
Texto completo da fonteStewart, Michael, e Wei Liu. "Seq2KG: An End-to-End Neural Model for Domain Agnostic Knowledge Graph (not Text Graph) Construction from Text". In 17th International Conference on Principles of Knowledge Representation and Reasoning {KR-2020}. California: International Joint Conferences on Artificial Intelligence Organization, 2020. http://dx.doi.org/10.24963/kr.2020/77.
Texto completo da fonteSchatz, Y., e B. Domer. "Optimizing IFC-structured Data Graph for Code Compliance Checking". In The 29th EG-ICE International Workshop on Intelligent Computing in Engineering. EG-ICE, 2022. http://dx.doi.org/10.7146/aul.455.c208.
Texto completo da fonteLeón, Jared. "A generalization of the block decomposition for k-connected graphs". In Encontro de Teoria da Computação. Sociedade Brasileira de Computação - SBC, 2022. http://dx.doi.org/10.5753/etc.2022.223106.
Texto completo da fonteHahn, Elad, e Offer Shai. "A Single Universal Construction Rule for the Structural Synthesis of Mechanisms". In ASME 2016 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. American Society of Mechanical Engineers, 2016. http://dx.doi.org/10.1115/detc2016-59133.
Texto completo da fonteHahn, Elad, Adnan Sljoka e Andreas Mueller. "Applications of Constraint Graphs and Assur Groups in Mechanism Analysis and Synthesis". In ASME 2017 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. American Society of Mechanical Engineers, 2017. http://dx.doi.org/10.1115/detc2017-67925.
Texto completo da fonteVajapeyam, Sridhar, e Michael Keefe. "Triangulated Surface Construction From Scattered 3-D Points". In ASME 1992 International Computers in Engineering Conference and Exposition. American Society of Mechanical Engineers, 1992. http://dx.doi.org/10.1115/cie1992-0087.
Texto completo da fonteGaliana, Mercedes, Nuria Rosa e Eloísa González. "TEACHING ARCHITECTURAL CONSTRUCTIONS THROUGH DIGITALIZED HAND DRAWING: CONSTRUCTION DETAILS WITH GRAPHIC TABLET". In 13th annual International Conference of Education, Research and Innovation. IATED, 2020. http://dx.doi.org/10.21125/iceri.2020.0788.
Texto completo da fonteRelatórios de organizações sobre o assunto "Construction de graphes"
Casamento, Katherine. Correct-by-Construction Typechecking with Scope Graphs. Portland State University Library, janeiro de 2000. http://dx.doi.org/10.15760/etd.7145.
Texto completo da fontePinter, Michael R. On Constructing Some Strongly Well-Covered Graphs. Fort Belvoir, VA: Defense Technical Information Center, janeiro de 1991. http://dx.doi.org/10.21236/ada261848.
Texto completo da fonteBorchmann, Daniel, Felix Distel e Francesco Kriegel. Axiomatization of General Concept Inclusions from Finite Interpretations. Technische Universität Dresden, 2015. http://dx.doi.org/10.25368/2022.219.
Texto completo da fonteHanish, Sam. The Art of Bond Graph Construction for Transducers. Fort Belvoir, VA: Defense Technical Information Center, setembro de 1999. http://dx.doi.org/10.21236/ada368288.
Texto completo da fonteSpangler, Stephen, Roger Fujan, Gerald Piotrowski e Brian Baker. A/E/C Graphics Standard : Release 2.2. Engineer Research and Development Center (U.S.), agosto de 2023. http://dx.doi.org/10.21079/11681/47452.
Texto completo da fonteKriegel, Francesco. Learning description logic axioms from discrete probability distributions over description graphs (Extended Version). Technische Universität Dresden, 2018. http://dx.doi.org/10.25368/2022.247.
Texto completo da fonteKüsters, Ralf, e Ralf Molitor. Computing Most Specific Concepts in Description Logics with Existential Restrictions. Aachen University of Technology, 2000. http://dx.doi.org/10.25368/2022.108.
Texto completo da fonteMathuria, Aakanksha. Approximate Pattern Matching using Hierarchical Graph Construction and Sparse Distributed Representation. Portland State University Library, janeiro de 2000. http://dx.doi.org/10.15760/etd.7453.
Texto completo da fonteChuchel, B. A. TURBOSEIS---An interactive program for constructing and editing models of seismic refraction traveltime data using a color-graphics terminal. Office of Scientific and Technical Information (OSTI), dezembro de 1989. http://dx.doi.org/10.2172/138346.
Texto completo da fonteMakhachashvili, Rusudan K., Svetlana I. Kovpik, Anna O. Bakhtina e Ekaterina O. Shmeltser. Technology of presentation of literature on the Emoji Maker platform: pedagogical function of graphic mimesis. [б. в.], julho de 2020. http://dx.doi.org/10.31812/123456789/3864.
Texto completo da fonte