„Graph computing“

Suchergebnisse

2.363 Treffer

• C-Planarity Testing of Embedded Clustered Graphs with Bounded Dual Carving-Width
  Da Lozzo, Giordano ; Eppstein, David ; Goodrich, Michael T. ; Gupta, Siddharth
• IFODHD: Improved Feature Selection Based Outlier Detection using Hyperdimensional Computing
  Xu, Wenrui ; Krainess, Evan ; Payani, Ali ; Latapie, Hugo ; Parhi, Keshab K.
• The Fuse Platform: Integrating data from IoT and other Sensors into an Industrial Spatial Digital Twin
  Biegel, Gregory ; Bower, Nicholas ; Castelnau, Will
• The Parameterised Complexity of Computing the Maximum Modularity of a Graph
  Meeks, Kitty ; Skerman, Fiona 2019 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Improving Detection of Autism Spectrum Disorder (ASD) by Using mRMR Feature Selection and Genetic Optimization Based CES Model for Computing Autism Severity Score
  Disha, D. N. ; Seema, S. ; Mathur, Archana
• Digital Imaging and Communications in Medicine (DICOM) – A Practical Introduction and Survival Guide
  Pianykh, Oleg 2012 Springer Berlin
• Transactions on large-scale data- and knowledge-centered systems
  Hameurlain, Abdelkader ; Tjoa, A Min 2025 Springer
• Brief Announcement: Decreasing Verification Radius in Local Certification
  Křišťan, Jan Matyáš ; Sedláček, Josef Erik 2024 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Brief Announcement: Distributed Maximum Flow in Planar Graphs
  Abd-Elhaleem, Yaseen ; Dory, Michal ; Parter, Merav ; Weimann, Oren 2024 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Massively Parallel Ruling Set Made Deterministic
  Giliberti, Jeff ; Parsaeian, Zahra 2024 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Distributed Model Checking on Graphs of Bounded Treedepth
  Fomin, Fedor V. ; Fraigniaud, Pierre ; Montealegre, Pedro ; Rapaport, Ivan ; Todinca, Ioan 2024 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Asynchronous Fault-Tolerant Distributed Proper Coloring of Graphs
  Balliu, Alkida ; Fraigniaud, Pierre ; Lambein-Monette, Patrick ; Olivetti, Dennis ; Rabie, Mikaël 2024 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Computing Diameter+2 in Truly-Subquadratic Time for Unit-Disk Graphs
  Chang, Hsien-Chih ; Gao, Jie ; Le, Hung 2024 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Computing Shortest Closed Curves on Non-Orientable Surfaces
  Bulavka, Denys ; Colin de Verdière, Éric ; Fuladi, Niloufar 2024 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• SZX-Calculus: Scalable Graphical Quantum Reasoning
  Carette, Titouan ; Horsman, Dominic ; Perdrix, Simon 2019 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Completeness of Graphical Languages for Mixed States Quantum Mechanics (Track B: Automata, Logic, Semantics, and Theory of Programming)
  Carette, Titouan ; Jeandel, Emmanuel ; Perdrix, Simon ; Vilmart, Renaud 2019 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• A Graphon Mean Field Convex Duality Approach to Shaping the Terminal Probability Distribution of a Network of Nonlinear Multi-Agent Systems
  Pakniyat, Ali
• Discrete Algorithms on Modern and Emerging Compute Infrastructure (Dagstuhl Seminar 24201)
  Hanauer, Kathrin ; Naumann, Uwe ; Pothen, Alex ; Schreiber, Robert
• Scalable Graph Mining and Learning (Dagstuhl Seminar 23491)
  Koutra, Danai ; Meyerhenke, Henning ; Safro, Ilya ; Brandt-Tumescheit, Fabian
• Precision Agriculture Using Internet of Things and Cloud Computing: A Review
  Sagar, Sourabh ; N. Birje, Mahantesh