„Graph computing“

Suchergebnisse

2.363 Treffer

• A Recipe for Quantum Graphical Languages
  Carette, Titouan ; Jeandel, Emmanuel 2020 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• AMD GPUs as an Alternative to NVIDIA for Supporting Real-Time Workloads
  Otterness, Nathan ; Anderson, James H. 2020 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• GPU-Accelerated Computation of Vietoris-Rips Persistence Barcodes
  Zhang, Simon ; Xiao, Mengbai ; Wang, Hao 2020 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Multi-parametric and priority driven particle swarm (MPPPSO) optimized task scheduling approach for improving performance of fog computing system
  Monika ; Sehrawat, Harkesh
• Computing isogeny on Edwards curves for quantum safe cryptography
  Chaudhary, Ankit ; Kumar, Manoj ; Upreti, Kamal ; Rathor, Akash ; Gupta, Pratik ; Farhat, Suryya ; Goswami, Shivender
• XNLP-Completeness for Parameterized Problems on Graphs with a Linear Structure
  Bodlaender, Hans L. ; Groenland, Carla ; Jacob, Hugo ; Jaffke, Lars ; Lima, Paloma T.
• MAX CUT in Weighted Random Intersection Graphs and Discrepancy of Sparse Random Set Systems
  Nikoletseas, Sotiris ; Raptopoulos, Christoforos ; Spirakis, Paul G.
• Subexponential Parameterized Algorithms and Kernelization on Almost Chordal Graphs
  Fomin, Fedor V. ; Golovach, Petr A.
• ZBrush Digital Sculpting Human Anatomy
  Spencer, Scott 2010 John Wiley & Sons
• Orbital hybridization in graphene-based artificial atoms
  Mao, Yue ; Ren, Hui-Ying ; Zhou, Xiao-Feng ; Sheng, Hao ; Xiao, Yun-Hao ; Zhuang, Yu-Chen ; Ren, Ya-Ning ; He, Lin ; Sun, Qing-Feng
• Exact Byzantine Consensus on Arbitrary Directed Graphs Under Local Broadcast Model
  Khan, Muhammad Samir ; Tseng, Lewis ; Vaidya, Nitin H. 2020 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Computing the Largest Bond of a Graph
  Duarte, Gabriel L. ; Lokshtanov, Daniel ; Pedrosa, Lehilton Lelis Chaves ; Schouery, Rafael C. S. ; Souza, Uéverton S. 2019 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Computing k-Modal Embeddings of Planar Digraphs
  Besa, Juan José ; Da Lozzo, Giordano ; Goodrich, Michael A. 2019 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Distributed Arboricity-Dependent Graph Coloring via All-to-All Communication
  Ghaffari, Mohsen ; Sayyadi, Ali 2019 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Distributed Detection of Cliques in Dynamic Networks
  Bonne, Matthias ; Censor-Hillel, Keren 2019 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Faster Approximation Algorithms for Computing Shortest Cycles on Weighted Graphs
  Ducoffe, Guillaume 2019 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Computing Optimal Shortcuts for Networks
  Garijo, Delia ; Márquez, Alberto ; Rodríguez, Natalia ; Silveira, Rodrigo I. 2018 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Computing the Chromatic Number Using Graph Decompositions via Matrix Rank
  Jansen, Bart M. P. ; Nederlof, Jesper 2018 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Weighted Model Counting on the GPU by Exploiting Small Treewidth
  Fichte, Johannes Klaus ; Hecher, Markus ; Woltran, Stefan ; Zisser, Markus 2018 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Avoiding Pitfalls when Using NVIDIA GPUs for Real-Time Tasks in Autonomous Systems
  Yang, Ming ; Otterness, Nathan ; Amert, Tanya ; Bakita, Joshua ; Anderson, James H. ; Smith, F. Donelson 2018 Schloss Dagstuhl – Leibniz-Zentrum für Informatik