Littérature scientifique sur le sujet « N-part graph »
Créez une référence correcte selon les styles APA, MLA, Chicago, Harvard et plusieurs autres
Consultez les listes thématiques d’articles de revues, de livres, de thèses, de rapports de conférences et d’autres sources académiques sur le sujet « N-part graph ».
À côté de chaque source dans la liste de références il y a un bouton « Ajouter à la bibliographie ». Cliquez sur ce bouton, et nous générerons automatiquement la référence bibliographique pour la source choisie selon votre style de citation préféré : APA, MLA, Harvard, Vancouver, Chicago, etc.
Vous pouvez aussi télécharger le texte intégral de la publication scolaire au format pdf et consulter son résumé en ligne lorsque ces informations sont inclues dans les métadonnées.
Articles de revues sur le sujet "N-part graph"
Day, Maxwell Christopher, Frank Christopher Hawthorne et Ali Rostami. « Bond topology of chain, ribbon and tube silicates. Part II. Geometrical analysis of infinite 1D arrangements of (TO4) n− tetrahedra ». Acta Crystallographica Section A Foundations and Advances 80, no 3 (29 avril 2024) : 258–81. http://dx.doi.org/10.1107/s2053273324002432.
Texte intégralGhanbari, Nima, et Saeid Alikhani. « A graph related to the Euler ø function ». Mathematical Gazette 107, no 569 (juillet 2023) : 263–72. http://dx.doi.org/10.1017/mag.2023.57.
Texte intégralLIN, YAW-LING, et STEVEN S. SKIENA. « COMPLEXITY ASPECTS OF VISIBILITY GRAPHS ». International Journal of Computational Geometry & ; Applications 05, no 03 (septembre 1995) : 289–312. http://dx.doi.org/10.1142/s0218195995000179.
Texte intégralXu, Chunyan, Rong Liu, Tong Zhang, Zhen Cui, Jian Yang et Chunlong Hu. « Dual-Stream Structured Graph Convolution Network for Skeleton-Based Action Recognition ». ACM Transactions on Multimedia Computing, Communications, and Applications 17, no 4 (30 novembre 2021) : 1–22. http://dx.doi.org/10.1145/3450410.
Texte intégralZhong, Chuang, et Shuangliang Tian. « Neighbor Sum Distinguishing Edge (Total) Coloring of Generalized Corona Product ». Journal of Physics : Conference Series 2381, no 1 (1 décembre 2022) : 012031. http://dx.doi.org/10.1088/1742-6596/2381/1/012031.
Texte intégralSason, Igal. « Observations on graph invariants with the Lovász $ \vartheta $-function ». AIMS Mathematics 9, no 6 (2024) : 15385–468. http://dx.doi.org/10.3934/math.2024747.
Texte intégralPetrenjuk, Volodymyr, et Dmytro Petreniuk. « Models of Klein Surface Obstruction Graphs ». Cybernetics and Computer Technologies, no 1 (29 mars 2024) : 47–63. http://dx.doi.org/10.34229/2707-451x.24.1.4.
Texte intégralIkhlaq, Hafiz Muhammad, Hafiz Muhammad Afzal Siddiqui et Muhammad Imran. « A Comparative Study of Three Resolving Parameters of Graphs ». Complexity 2021 (15 décembre 2021) : 1–13. http://dx.doi.org/10.1155/2021/1927181.
Texte intégralBEDNARSKA-BZDȨGA, MAŁGORZATA, DAN HEFETZ, MICHAEL KRIVELEVICH et TOMASZ ŁUCZAK. « Manipulative Waiters with Probabilistic Intuition ». Combinatorics, Probability and Computing 25, no 6 (21 décembre 2015) : 823–49. http://dx.doi.org/10.1017/s0963548315000310.
Texte intégralHamidi, Mohammad, et Irina Cristea. « Hyperideal-based zero-divisor graph of the general hyperring $ \mathbb{Z}_{n} $ ». AIMS Mathematics 9, no 6 (2024) : 15891–910. http://dx.doi.org/10.3934/math.2024768.
Texte intégralThèses sur le sujet "N-part graph"
Montagner, Arnaldo Jovanini. « A estrutura de dados gema para representação de mapas n-dimensionais ». [s.n.], 2007. http://repositorio.unicamp.br/jspui/handle/REPOSIP/276246.
Texte intégralTese (doutorado) - Universidade Estadual de Campinas, Instituto de Computação.
Made available in DSpace on 2018-08-10T07:43:58Z (GMT). No. of bitstreams: 1 Montagner_ArnaldoJovanini_D.pdf: 2204093 bytes, checksum: 4c9c86ca0312f3b5507e1daa8c6553db (MD5) Previous issue date: 2007
Resumo: Mapas são subdivisões de espaços topológicos em regiões simples, e triangulações são um tipo específico de mapa em que cada elemento é um simplexo (aresta, triângulo, tetraedro, etc). Neste trabalho, tratamos o problema de representação da topologia de triangulações e mapas de dimensão arbitrária. Estudamos a utilização de uma representação baseada em grafos de arestas coloridas, já utilizada como ferramenta teórica, mas nunca empregada em aplicações práticas. A principal limitação desta representação é a relativa inflexibilidade imposta sobre a manipulação da topologia. Há porém grandes vantagens em sua utilização, como a simplicidade de representação e a generalidade. Este trabalho consiste na especificação teórica de uma estrutura de dados baseada nestes grafos coloridos e de operações topológicas para construção e manipulação da estrutura. A utilização desta estrutura é ilustrada através de algoritmos para resolução de problemas em geometria computacional
Abstract: Maps are subdivisions of topological spaces into simple regions, and triangulations are a specific kind of map wherein each element is a simplex (edge, triangle, tetrahedron, etc). In this work, we analyze the problem of representing the topology of triangulations and maps with arbitrary dimension. We study a representation based on edge-colored graphs, already used as theoretical tool, but never employed in practical applications. The main limitation of this representation is the relative inexibility imposed on the manipulation of topology. There are, though, great advantages in its use, as its simplicity and generality. This work consists in the theoretic specification of a data structure based on these colored graphs and of topological operators to build and manipulate the structure.The use of this structure is illustrated by algorithms for computational geometry problems
Doutorado
Computação Grafica
Mestre em Ciência da Computação
Ghaemi, Mohammadreza. « Etude de la complexité algorithmique associée à des opérations de décomposition de graphes ». Paris 6, 2008. http://www.theses.fr/2008PA066449.
Texte intégralSharma, Manish. « Receptores iterativos para canais de acesso múltiplo ruidosos com N frequências e T usuários ». [s.n.], 2010. http://repositorio.unicamp.br/jspui/handle/REPOSIP/260834.
Texte intégralTese (doutorado) - Universidade Estadual de Campinas, Faculdade de Engenharia Elétrica e de Computação
Made available in DSpace on 2018-08-17T00:51:09Z (GMT). No. of bitstreams: 1 Sharma_Manish_D.pdf: 1122815 bytes, checksum: ac184067a2eeb2f29617e0a5da608708 (MD5) Previous issue date: 2010
Resumo: O objetivo deste trabalho é analisar o desempenho da recepção e detecção conjunta e iterativa para canais de acesso múltiplo. A análise se concentrou em torno de um canal ruidoso com N frequências compartilhado por T usuários. Encontramos valores para a capacidade do canal para detecção conjunta e individual. Embora a eficiência espectral do sistema seja relativamente baixa, a combinação deste fator com uma grande faixa de frequências permite altas taxas de transmissão com baixa relação sinal ruído. O receptor foi modelado como um grafo de fatores e foi analisado através de curvas EXIT, que também são utilizadas para otimizar os códigos corretores de erro dos usuários. Propomos alguns sistemas baseados nesta técnica e simulamos a sua probabilidade de erro de bit. Os resultados indicam que é possível transmitir informação com taxas próximas da capacidade do canal. Tanto o grafo do receptor como as análises subsequentes podem ser aplicadas para outros canais de acesso múltiplo, especialmente para sistemas com N símbolos de transmissão ortogonais.
Abstract: The aim of this work is to analyze the performance of iterative joint reception and detection for multi-user channels. The analysis is centered around an N-frequency MFSK noisy channel shared by T users. Channel capacity values are obtained for joint and single user detection. Although the system's spectral efficiency is low, high rates at low signal to noise ratio are achievable by using a wide-bandwidth channel. The receiver is modeled as a factor graph and analyzed by its EXIT charts, which were also used to analyze the users' error correcting codes. Some systems are proposed and simulated to obtain the bit error probability. Results indicate that it is possible to transmit information with rates close to channel capacity. The proposed receiver and the performed analysis can be applied to other types of multiple access channels, in particular for systems with N orthogonal transmission symbols.
Doutorado
Telecomunicações e Telemática
Doutor em Engenharia Elétrica
Livres sur le sujet "N-part graph"
Tanasa, Adrian. Combinatorial Physics. Oxford University Press, 2021. http://dx.doi.org/10.1093/oso/9780192895493.001.0001.
Texte intégralKJV Study Bible for Girls Grape/Surf Blue, Floral Design Duravella. Baker Books, 2016.
Trouver le texte intégralChapitres de livres sur le sujet "N-part graph"
Schiff, Krzysztof. « Partitioning of an M-Part Weighted Graph with N Vertices in Each Part into N Cliques with M Vertices and the Total Minimum Sum of Their Edges Weights Using Ant Algorithms ». Dans Lecture Notes in Networks and Systems, 265–72. Cham : Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-37720-4_24.
Texte intégralBall, John, et Dominic Welsh. « Algebra In Graph Theory ». Dans Graph Theory as I Have Known It, 46–63. Oxford University PressOxford, 1998. http://dx.doi.org/10.1093/oso/9780198502517.003.0005.
Texte intégralAlhassan, Ahmad, et Auwal Aliyu. « The Principle of Interpretation of Gravity Data Using Second Vertical Derivative Method ». Dans Gravitational Field - Concepts and Applications. IntechOpen, 2022. http://dx.doi.org/10.5772/intechopen.100443.
Texte intégralSmith, Justin R. « Graph Algorithms ». Dans The Design and Analysis of Parallel Algorithms, 313–69. Oxford University PressNew York, NY, 1993. http://dx.doi.org/10.1093/oso/9780195078817.003.0026.
Texte intégralShaikh, Zulfa, et Poonam Garg. « Secure Multiparty Computing Protocol ». Dans Interdisciplinary Perspectives on Business Convergence, Computing, and Legality, 132–43. IGI Global, 2013. http://dx.doi.org/10.4018/978-1-4666-4209-6.ch012.
Texte intégralActes de conférences sur le sujet "N-part graph"
McMains, Sara, et Xiaorui Chen. « Determining Moldability and Parting Directions for Polygons With Curved Edges ». Dans ASME 2004 International Mechanical Engineering Congress and Exposition. ASMEDC, 2004. http://dx.doi.org/10.1115/imece2004-62227.
Texte intégralRanger, A. E. « Surface Structure of Coatings ». Dans Papermaking Raw Materials, sous la direction de V. Punton. Fundamental Research Committee (FRC), Manchester, 1985. http://dx.doi.org/10.15376/frc.1985.2.673.
Texte intégralMota, Guilherme Oliveira. « Advances in anti-Ramsey theory for random graphs ». Dans II Encontro de Teoria da Computação. Sociedade Brasileira de Computação - SBC, 2017. http://dx.doi.org/10.5753/etc.2017.3204.
Texte intégralKumar T. V., Sateesh, et S. Meenakshi. « Lucky labeling of jelly fish graph J(m, n), cocktail party graph CPk and crown graph Cn* ». Dans 2ND INTERNATIONAL CONFERENCE ON MATHEMATICAL TECHNIQUES AND APPLICATIONS : ICMTA2021. AIP Publishing, 2022. http://dx.doi.org/10.1063/5.0108660.
Texte intégralYou, Li. « Multi-party quantum correlation and entanglement ». Dans Workshop on Entanglement and Quantum Decoherence. Washington, D.C. : Optica Publishing Group, 2008. http://dx.doi.org/10.1364/weqd.2008.eas2.
Texte intégralGopalakrishnan, Praveen Kumare, Jeffery Cavallaro, Sogol Jahanbekam et Sara Behdad. « A Graph Coloring Technique for Identifying the Minimum Number of Parts for Physical Integration in Product Design ». Dans ASME 2019 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. American Society of Mechanical Engineers, 2019. http://dx.doi.org/10.1115/detc2019-98251.
Texte intégralOliveira, Rafael F., Vander L. S. Freitas, Gladston J. P. Moreira et Eduardo J. S. Luz. « Explorando Redes Neurais de Grafos para Classificação de Arritmias ». Dans Simpósio Brasileiro de Computação Aplicada à Saúde. Sociedade Brasileira de Computação - SBC, 2022. http://dx.doi.org/10.5753/sbcas.2022.222510.
Texte intégralAvila, Caio Viktor S., et Vania Vidal. « LiRB : Um Navegador Leve Baseado em Texto para Knowledge Graphs RDF ». Dans Anais Estendidos do Simpósio Brasileiro de Banco de Dados. Sociedade Brasileira de Computação - SBC, 2023. http://dx.doi.org/10.5753/sbbd_estendido.2023.232837.
Texte intégralFasanelli, Roberto, Anna Liguori et Ida Galli. « A Similarity Graph-based Approach to Study Social Representations of the Economic Crisis : A Comparison between Italian and Greek Social Groups ». Dans International Association of Cross Cultural Psychology Congress. International Association for Cross-Cultural Psychology, 2016. http://dx.doi.org/10.4087/trkm7515.
Texte intégralShrivastava, Parnika, J. J. Roy, M. K. Samal, P. K. Jain et Puneet Tandon. « Parameter Optimization of Incremental Sheet Metal Forming Based on Taguchi Design and Response Surface Methodology ». Dans ASME 2015 International Mechanical Engineering Congress and Exposition. American Society of Mechanical Engineers, 2015. http://dx.doi.org/10.1115/imece2015-51227.
Texte intégral