„Random graph“

Suchergebnisse

1.427 Treffer

• Modeling and optimization of Quality of Service routing in Mobile Ad hoc Networks
  Rafsanjani, Marjan Kuchaki ; Fatemidokht, Hamideh ; Balas, Valentina Emilia
• Pairwise interaction on random graphs
  Berninghaus, Siegfried ; Haller, Hans 2007 Universitätsbibliothek Mannheim
• Faster Multi-parameter Thumbnail Preserving Scheme Based on Random Wandering and DHKE for Cloud Environments
  Chai, Xiuli ; Wang, Changze ; Xiong, Qinghua ; Zhao, Xiuming ; Zhang, Yushu
• A Dynamic Model for Random Vibration Analysis of Functionally Graded Graphene Platelet Reinforced Composite Coupled Plates using the Spectro-Geometric Method
  Zuo, Peng ; Du, Zhao ; Feng, Huiyong ; Shi, Xianjie ; Hu, Bing ; He, Chuanchuan
• Percolation in the Poisson Boolean model with convex grains
  Korfhage, Marilyn ; Mörters, Peter ; Gusakova, Anna 2025 Universitäts- und Stadtbibliothek Köln
• Reconstructing Random Graphs from Distance Queries
  Krivelevich, Michael ; Zhukovskii, Maksim 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• MorphisHash: Improving Space Efficiency of ShockHash for Minimal Perfect Hashing
  Hermann, Stefan 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• A Random Graph Diffusion Attention Network with Great Wall Construction and Clinical Metadata for Improved Kidney Cancer Diagnosis and Surgical Planning
  Faisal, Syed Mohd ; Muniyandy, Elangovan ; Lokesh, S. ; Jayanthi, M. G.
• Enhanced Multimodal Breast Cancer Diagnosis Using Random Graph Diffusion-Based Two-Branch Attention Adversarial Domain Adaptation with Improved Orca Predation Optimization
  Vetrithangam, D. ; Anguraj, Dinesh Kumar ; Arunachalam, Krishna Prakash ; Rangarajan, Nidhya
• Randomized Algorithms: Approximation, Generation and Counting
  2001 Springer London
• Explosive Percolation in Random Networks
  Chen, Wei 2014 Springer Berlin Heidelberg
• Hyperbolic Random Graphs: Clique Number and Degeneracy with Implications for Colouring
  Baguley, Samuel ; Maus, Yannic ; Ruff, Janosch ; Skretas, George 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• "We Are Only as Strong as We Are United, as Weak as We Are Divided" a Dynamic Analysis of the Peer Support Networks in the Harry Potter Books
  Bossaert, Goele ; Meidert, Nadine 2013 Bibliothek der Universität Konstanz
• Machine learning-based Graphical User Interface for predicting high-performance concrete compressive strength: Comparative analysis of Gradient Boosting Machine, Random Forest, and Deep Neural Network Models
  Ahmad, Furquan ; Alasskar, Albaraa ; Samui, Pijush ; Asteris, Panagiotis G.
• Combinatorial Algorithms – 28th International Workshop, IWOCA 2017, Newcastle, NSW, Australia, July 17-21, 2017, Revised Selected Papers
  Brankovic, Ljiljana ; Ryan, Joe ; Smyth, William F. 2018 Springer International Publishing
• Algorithms and Models for the Web Graph – 15th International Workshop, WAW 2018, Moscow, Russia, May 17-18, 2018, Proceedings
  Bonato, Antony ; Pralat, Pawel ; Raigorodskii, Andrei 2018 Springer International Publishing
• Teachers’ professional collaboration and trust relationships – An inferential social network analysis of teacher teams
  Kolleck, Nina ; Schuster, Johannes ; Hartmann, Ulrike ; Gräsel, Cornelia 2023 Universitätsbibliothek Leipzig
• On the clustering property of the random intersection graphs
  Yao, Xin ; Chen, Jinwen ; Zhang, Changshui ; Li, Yanda 2008 Berlin : Weierstraß-Institut für Angewandte Analysis und Stochastik
• Shared Randomness in Locally Checkable Problems: The Role of Computational Assumptions
  Hadad, Adar ; Naor, Moni 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Algorithmic Contiguity from Low-Degree Conjecture and Applications in Correlated Random Graphs
  Li, Zhangsong 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik