Artigos de revistas sobre o tema "Projection de graphe"
Crie uma referência precisa em APA, MLA, Chicago, Harvard, e outros estilos
Veja os 50 melhores artigos de revistas para estudos sobre o assunto "Projection de graphe".
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.
Veja os artigos de revistas das mais diversas áreas científicas e compile uma bibliografia correta.
Mezroui, Yahya. "Projection orthogonale sur le graphe d’une relation linéaire fermé". Transactions of the American Mathematical Society 352, n.º 6 (15 de dezembro de 1999): 2789–800. http://dx.doi.org/10.1090/s0002-9947-99-02410-1.
Texto completo da fonteLedermann, Florian. "Classifying Cartographic Projections Based on Dynamic Analysis of Program Code". Abstracts of the ICA 2 (9 de outubro de 2020): 1. http://dx.doi.org/10.5194/ica-abs-2-38-2020.
Texto completo da fonteDilworth, Stephen J., Denka Kutzarova e Mikhail I. Ostrovskii. "Lipschitz-free Spaces on Finite Metric Spaces". Canadian Journal of Mathematics 72, n.º 3 (13 de fevereiro de 2019): 774–804. http://dx.doi.org/10.4153/s0008414x19000087.
Texto completo da fonteBae, Yeolhui, Yugyeom Yi, Jeongmoo Lee e Sungmo Kang. "Research on Definition of BLL Graphs of Knot Diagrams and its Applications". Korean Science Education Society for the Gifted 14, n.º 3 (30 de dezembro de 2022): 229–36. http://dx.doi.org/10.29306/jseg.2022.14.3.229.
Texto completo da fonteLarose, Benoit. "Strongly Projective Graphs". Canadian Journal of Mathematics 54, n.º 4 (1 de agosto de 2002): 757–68. http://dx.doi.org/10.4153/cjm-2002-029-7.
Texto completo da fonteKaliszewski, S., Alex Kumjian, John Quigg e Aidan Sims. "Topological realizations and fundamental groups of higher-rank graphs". Proceedings of the Edinburgh Mathematical Society 59, n.º 1 (10 de junho de 2015): 143–68. http://dx.doi.org/10.1017/s0013091515000061.
Texto completo da fonteNIKKUNI, RYO. "COMPLETELY DISTINGUISHABLE PROJECTIONS OF SPATIAL GRAPHS". Journal of Knot Theory and Its Ramifications 15, n.º 01 (janeiro de 2006): 11–19. http://dx.doi.org/10.1142/s0218216506004282.
Texto completo da fonteHUH, YOUNGSIK. "AN ELEMENTARY SET FOR EMBEDDED BOUQUET GRAPHS WITH TWO CYCLES". Journal of Knot Theory and Its Ramifications 20, n.º 02 (fevereiro de 2011): 305–25. http://dx.doi.org/10.1142/s0218216511008796.
Texto completo da fonteFilippova, P. A. "Values of the weight system on a family of graphs that are not the intersection graphs of chord diagrams". Sbornik: Mathematics 213, n.º 2 (1 de fevereiro de 2022): 235–67. http://dx.doi.org/10.1070/sm9519.
Texto completo da fonteHUH, YOUNGSIK, e KOUKI TANIYAMA. "IDENTIFIABLE PROJECTIONS OF SPATIAL GRAPHS". Journal of Knot Theory and Its Ramifications 13, n.º 08 (dezembro de 2004): 991–98. http://dx.doi.org/10.1142/s0218216504003640.
Texto completo da fonteNIKKUNI, RYO, MAKOTO OZAWA, KOUKI TANIYAMA e YUKIHIRO TSUTSUMI. "NEWLY FOUND FORBIDDEN GRAPHS FOR TRIVIALIZABILITY". Journal of Knot Theory and Its Ramifications 14, n.º 04 (junho de 2005): 523–38. http://dx.doi.org/10.1142/s0218216505003932.
Texto completo da fonteHjouj, Fawaz. "On Tomography with Unknown Orientation". Journal of Mathematical Sciences & Computer Applications 2, n.º 2 (10 de junho de 2017): 125–35. http://dx.doi.org/10.5147/jmsca.v2i1.99.
Texto completo da fonteCAELLI, TERRY, e SERHIY KOSINOV. "INEXACT GRAPH MATCHING USING EIGEN-SUBSPACE PROJECTION CLUSTERING". International Journal of Pattern Recognition and Artificial Intelligence 18, n.º 03 (maio de 2004): 329–54. http://dx.doi.org/10.1142/s0218001404003186.
Texto completo da fonteSumet Mehta. "Generalized Multi-manifold Graph Ensemble Embedding for Multi-View Dimensionality Reduction". Lahore Garrison University Research Journal of Computer Science and Information Technology 4, n.º 4 (28 de dezembro de 2020): 55–72. http://dx.doi.org/10.54692/lgurjcsit.2020.0404109.
Texto completo da fonteHANAKI, RYO. "REGULAR PROJECTIONS OF KNOTTED DOUBLE-HANDCUFF GRAPHS". Journal of Knot Theory and Its Ramifications 18, n.º 11 (novembro de 2009): 1475–92. http://dx.doi.org/10.1142/s0218216509007567.
Texto completo da fonteAceves, Elaina. "A study of projections of 2-bouquet graphs". Journal of Knot Theory and Its Ramifications 26, n.º 05 (abril de 2017): 1750025. http://dx.doi.org/10.1142/s0218216517500250.
Texto completo da fontePetrenjuk, Volodymyr, Dmytro Petreniuk e Oleh Oryshaka. "Structure of Projective Planar Subgraphs of the Graph Obstructions for Fixed Surface". Cybernetics and Computer Technologies, n.º 2 (30 de setembro de 2022): 13–30. http://dx.doi.org/10.34229/2707-451x.22.2.2.
Texto completo da fonteFukś, Henryk, Babak Farzad e Yi Cao. "A model of language inflection graphs". International Journal of Modern Physics C 25, n.º 06 (23 de abril de 2014): 1450013. http://dx.doi.org/10.1142/s0129183114500132.
Texto completo da fonteDouar, Brahim, Chiraz Latiri, Michel Liquiere e Yahya Slimani. "A Projection Bias in Frequent Subgraph Mining Can Make a Difference". International Journal on Artificial Intelligence Tools 23, n.º 05 (outubro de 2014): 1450005. http://dx.doi.org/10.1142/s0218213014500055.
Texto completo da fonteZhang, Xianhang, Hanchen Wang, Jianke Yu, Chen Chen, Xiaoyang Wang e Wenjie Zhang. "Polarity-based graph neural network for sign prediction in signed bipartite graphs". World Wide Web 25, n.º 2 (16 de fevereiro de 2022): 471–87. http://dx.doi.org/10.1007/s11280-022-01015-4.
Texto completo da fonteSawollek, Jörg. "Embeddings of 4-Regular Graphs into 3-Space". Journal of Knot Theory and Its Ramifications 06, n.º 05 (outubro de 1997): 727–49. http://dx.doi.org/10.1142/s0218216597000406.
Texto completo da fonteSHTYLLA, BLERTA, e LOUIS ZULLI. "AN EXTENSION OF THE JONES POLYNOMIAL OF CLASSICAL KNOTS". Journal of Knot Theory and Its Ramifications 15, n.º 01 (janeiro de 2006): 81–100. http://dx.doi.org/10.1142/s0218216506004294.
Texto completo da fonteArockiamary, S. Teresa, C. Meera e V. Santhi. "Connectedness in Projection Graphs of Commutative Rings". Indian Journal Of Science And Technology 16, SP3 (15 de dezembro de 2023): 55–63. http://dx.doi.org/10.17485/ijst/v16isp3.icrtam293.
Texto completo da fonteShen, Xiang-Jun, Stanley Ebhohimhen Abhadiomhen, Yang Yang, Zhifeng Liu e Sirui Tian. "Edge Structure Learning via Low Rank Residuals for Robust Image Classification". Proceedings of the AAAI Conference on Artificial Intelligence 37, n.º 2 (26 de junho de 2023): 2236–44. http://dx.doi.org/10.1609/aaai.v37i2.25318.
Texto completo da fonteBach, Nguyen Gia, Chanh Minh Tran, Tho Nguyen Duc, Phan Xuan Tan e Eiji Kamioka. "Novel Projection Schemes for Graph-Based Light Field Coding". Sensors 22, n.º 13 (30 de junho de 2022): 4948. http://dx.doi.org/10.3390/s22134948.
Texto completo da fonteZHOU, JIN-XIN, e YAN-QUAN FENG. "TETRAVALENT s-TRANSITIVE GRAPHS OF ORDER TWICE A PRIME POWER". Journal of the Australian Mathematical Society 88, n.º 2 (abril de 2010): 277–88. http://dx.doi.org/10.1017/s1446788710000066.
Texto completo da fonteVARADI, Zoltan. "How Graphs can Improve Targeting of Employee Trainings?" Eurasia Proceedings of Educational and Social Sciences 31 (30 de outubro de 2023): 135–42. http://dx.doi.org/10.55549/epess.1381972.
Texto completo da fontePetrenjuk, Volodymyr, e Dmytro Petreniuk. "Models of Klein Surface Obstruction Graphs". Cybernetics and Computer Technologies, n.º 1 (29 de março de 2024): 47–63. http://dx.doi.org/10.34229/2707-451x.24.1.4.
Texto completo da fontePetrenjuk, V. I., e D. A. Petrenjuk. "About Structure of Graph Obstructions for Klein Surface with 9 Vertices". Cybernetics and Computer Technologies, n.º 4 (31 de dezembro de 2020): 65–86. http://dx.doi.org/10.34229/2707-451x.20.4.5.
Texto completo da fonteDogan, I., e A. Akpinar. "On Distance in Some Finite Planes and Graphs Arising from Those Planes". Journal of Mathematics 2021 (28 de janeiro de 2021): 1–17. http://dx.doi.org/10.1155/2021/6668682.
Texto completo da fonteKHEIRABADI, M., e A. R. MOGHADDAMFAR. "RECOGNIZING SOME FINITE SIMPLE GROUPS BY NONCOMMUTING GRAPH". Journal of Algebra and Its Applications 11, n.º 04 (31 de julho de 2012): 1250077. http://dx.doi.org/10.1142/s0219498812500776.
Texto completo da fonteHogben, Leslie, Kevin Palmowski, David Roberson e Simone Severini. "Orthogonal Representations, Projective Rank, and Fractional Minimum Positive Semidefinite Rank: Connections and New Directions". Electronic Journal of Linear Algebra 32 (6 de fevereiro de 2017): 98–115. http://dx.doi.org/10.13001/1081-3810.3102.
Texto completo da fonteFENG, GUIYU, DAVID ZHANG, JIAN YANG e DEWEN HU. "A THEORETICAL FRAMEWORK FOR MATRIX-BASED FEATURE EXTRACTION ALGORITHMS WITH ITS APPLICATION TO IMAGE RECOGNITION". International Journal of Image and Graphics 08, n.º 01 (janeiro de 2008): 1–23. http://dx.doi.org/10.1142/s0219467808002940.
Texto completo da fontePrakash, Sudhir, Rakesh Kumar, Piyush Rai, Shiksha Jain, Manish Singh, Rajnish Pandey, Saanidhya Dubey, Shobhit Srivatava e Anoop K. Srivastava. "A Study of Chemical Compound of Graph with help of Computer Coding". Turkish Journal of Computer and Mathematics Education (TURCOMAT) 10, n.º 3 (13 de dezembro de 2019): 1553–64. http://dx.doi.org/10.61841/turcomat.v10i3.14357.
Texto completo da fontePan, Lei, Hengchao Li, Xiang Dai, Ying Cui, Xifeng Huang e Lican Dai. "Latent Low-Rank Projection Learning with Graph Regularization for Feature Extraction of Hyperspectral Images". Remote Sensing 14, n.º 13 (27 de junho de 2022): 3078. http://dx.doi.org/10.3390/rs14133078.
Texto completo da fonteIvanov, Alexander A. "The non-existence of a super-Janko group". Glasnik Matematicki 58, n.º 2 (27 de dezembro de 2023): 289–305. http://dx.doi.org/10.3336/gm.58.2.09.
Texto completo da fonteNayyeri, Mojtaba, Sahar Vahdati, Can Aykul e Jens Lehmann. "5* Knowledge Graph Embeddings with Projective Transformations". Proceedings of the AAAI Conference on Artificial Intelligence 35, n.º 10 (18 de maio de 2021): 9064–72. http://dx.doi.org/10.1609/aaai.v35i10.17095.
Texto completo da fonteJanson, Svante. "The Numbers of Spanning Trees, Hamilton Cycles and Perfect Matchings in a Random Graph". Combinatorics, Probability and Computing 3, n.º 1 (março de 1994): 97–126. http://dx.doi.org/10.1017/s0963548300001012.
Texto completo da fonteLi, Haohao, Mingliang Gao, Huibing Wang e Gwanggil Jeon. "Multi-View Projection Learning via Adaptive Graph Embedding for Dimensionality Reduction". Electronics 12, n.º 13 (3 de julho de 2023): 2934. http://dx.doi.org/10.3390/electronics12132934.
Texto completo da fonteDAMIAN, MIRELA, e KRISTIN RAUDONIS. "YAO GRAPHS SPAN THETA GRAPHS". Discrete Mathematics, Algorithms and Applications 04, n.º 02 (junho de 2012): 1250024. http://dx.doi.org/10.1142/s1793830912500243.
Texto completo da fonteThrun, Michael C., Julian Märte e Quirin Stier. "Analyzing Quality Measurements for Dimensionality Reduction". Machine Learning and Knowledge Extraction 5, n.º 3 (21 de agosto de 2023): 1076–118. http://dx.doi.org/10.3390/make5030056.
Texto completo da fonteChen, Zhaoliang, Zhihao Wu, Shiping Wang e Wenzhong Guo. "Dual Low-Rank Graph Autoencoder for Semantic and Topological Networks". Proceedings of the AAAI Conference on Artificial Intelligence 37, n.º 4 (26 de junho de 2023): 4191–98. http://dx.doi.org/10.1609/aaai.v37i4.25536.
Texto completo da fonteWagenpfeil, Stefan, Binh Vu, Paul Mc Kevitt e Matthias Hemmje. "Fast and Effective Retrieval for Large Multimedia Collections". Big Data and Cognitive Computing 5, n.º 3 (22 de julho de 2021): 33. http://dx.doi.org/10.3390/bdcc5030033.
Texto completo da fonteCao, Keyan, e Chuang Zheng. "TBRm: A Time Representation Method for Industrial Knowledge Graph". Applied Sciences 12, n.º 22 (8 de novembro de 2022): 11316. http://dx.doi.org/10.3390/app122211316.
Texto completo da fonteZhang, Zhao Yang, Zheng Tian e Wei Dong Yan. "Spectral Feature Matching Based on Isometric Projection of Matrix". Applied Mechanics and Materials 121-126 (outubro de 2011): 4161–65. http://dx.doi.org/10.4028/www.scientific.net/amm.121-126.4161.
Texto completo da fonteCHOWDHURY, SUBHADIP. "Ziggurat fringes are self-similar". Ergodic Theory and Dynamical Systems 37, n.º 3 (28 de dezembro de 2015): 739–57. http://dx.doi.org/10.1017/etds.2015.75.
Texto completo da fonteGARDINER, A., CHERYL E. PRAEGER e SANMING ZHOU. "CROSS RATIO GRAPHS". Journal of the London Mathematical Society 64, n.º 2 (outubro de 2001): 257–72. http://dx.doi.org/10.1112/s0024610701002150.
Texto completo da fonteLin, Lin, Jie Liu, Feng Guo, Changsheng Tong, Lizheng Zu e Hao Guo. "ERDERP: Entity and Relation Double Embedding on Relation Hyperplanes and Relation Projection Hyperplanes". Mathematics 10, n.º 22 (9 de novembro de 2022): 4182. http://dx.doi.org/10.3390/math10224182.
Texto completo da fonteZinova, Polina Aleksandrovna, e Maxim Eduardovich Kazarian. "Algebra of shares, complete bipartite graphs and $\mathfrak{sl}_2$ weight system". Sbornik: Mathematics 214, n.º 6 (2023): 832–52. http://dx.doi.org/10.4213/sm9795e.
Texto completo da fonteWang, Peng, Jingju Liu, Dongdong Hou e Shicheng Zhou. "A Cybersecurity Knowledge Graph Completion Method Based on Ensemble Learning and Adversarial Training". Applied Sciences 12, n.º 24 (16 de dezembro de 2022): 12947. http://dx.doi.org/10.3390/app122412947.
Texto completo da fonte