• case-insensitive prefix search: default
  e.g., sig matches "SIGIR" as well as "signal"
• exact word search: append dollar sign ($) to word
  e.g., graph$ matches "graph", but not "graphics"
• boolean and: separate words by space
  e.g., codd model
• boolean or: connect words by pipe symbol (|)
  e.g., graph|network

Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.

found 94 matches

• 2024
• 
  Viktoria Mayer, Wilfried N. Gansterer:
  A New Exact State Reconstruction Strategy for Conjugate Gradient Methods with Arbitrary Preconditioners. IPDPS (Workshops) 2024: 1150-1152
• 
  Lorenz Kummer, Samir Moustafa, Sebastian Schrittwieser, Wilfried N. Gansterer, Nils M. Kriege:
  Attacking Graph Neural Networks with Bit Flips: Weisfeiler and Leman Go Indifferent. KDD 2024: 1428-1439
• 
  Franka Bause, Samir Moustafa, Johannes Langguth, Wilfried N. Gansterer, Nils M. Kriege:
  On the Two Sides of Redundancy in Graph Neural Networks. ECML/PKDD (6) 2024: 371-388
• 2023
• 
  Lorenz Kummer, Kevin Sidak, Tabea Reichmann, Wilfried N. Gansterer:
  Adaptive Precision Training (AdaPT): A dynamic quantized training approach for DNNs. SDM 2023: 559-567
• 
  Franka Bause, Samir Moustafa, Johannes Langguth, Wilfried N. Gansterer, Nils M. Kriege:
  Non-Redundant Graph Neural Networks with Improved Expressiveness. CoRR abs/2310.04190 (2023)
• 
  Lorenz Kummer, Samir Moustafa, Nils M. Kriege, Wilfried N. Gansterer:
  Attacking Graph Neural Networks with Bit Flips: Weisfeiler and Lehman Go Indifferent. CoRR abs/2311.01205 (2023)
• 2022
• 
  Emmanuel Agullo, Mirco Altenbernd, Hartwig Anzt, Leonardo Bautista-Gomez, Tommaso Benacchio, Luca Bonaventura, Hans-Joachim Bungartz, Sanjay Chatterjee, Florina M. Ciorba, Nathan DeBardeleben, Daniel Drzisga, Sebastian Eibl, Christian Engelmann, Wilfried N. Gansterer, Luc Giraud, Dominik Göddeke, Marco Heisig, Fabienne Jézéquel, Nils Kohl, Xiaoye Sherry Li, Romain Lion, Miriam Mehl, Paul Mycek, Michael Obersteiner, Enrique S. Quintana-Ortí, Francesco Rizzi, Ulrich Rüde, Martin Schulz, Fred Fung, Robert Speck, Linda Stals, Keita Teranishi, Samuel Thibault, Dominik Thönnes, Andreas Wagner, Barbara I. Wohlmuth:
  Resiliency in numerical algorithm design for extreme scale simulations. Int. J. High Perform. Comput. Appl. 36(2): 251-285 (2022)
• 
  Robert Ernstbrunner, Viktoria Mayer, Wilfried N. Gansterer:
  Accuracy vs. Cost in Parallel Fixed-Precision Low-Rank Approximations of Sparse Matrices. IPDPS 2022: 459-469
• 2021
• 
  Lorenz Kummer, Kevin Sidak, Tabea Reichmann, Wilfried N. Gansterer:
  MARViN - Multiple Arithmetic Resolutions Vacillating in Neural Networks. CoRR abs/2107.13490 (2021)
• 2020
• 
  Karl E. Prikopa, Wilfried N. Gansterer:
  Fault-tolerant least squares solvers for wireless sensor networks based on gossiping. J. Parallel Distributed Comput. 136: 52-62 (2020)
• 
  Carlos Pachajoa, Christina Pacher, Markus Levonyak, Wilfried N. Gansterer:
  Algorithm-Based Checkpoint-Recovery for the Conjugate Gradient Method. ICPP 2020: 14:1-14:11
• 
  Markus Levonyak, Christina Pacher, Wilfried N. Gansterer:
  Scalable Resilience Against Node Failures for Communication-Hiding Preconditioned Conjugate Gradient and Conjugate Residual Methods. PP 2020: 81-92
• 
  Carlos Pachajoa, Robert Ernstbrunner, Wilfried N. Gansterer:
  A Generic Strategy for Node-Failure Resilience for Certain Iterative Linear Algebra Methods. FTXS@SC 2020: 41-50
• 
  Carlos Pachajoa, Christina Pacher, Markus Levonyak, Wilfried N. Gansterer:
  Algorithm-Based Checkpoint-Recovery for the Conjugate Gradient Method. CoRR abs/2007.04066 (2020)
• 
  Emmanuel Agullo, Mirco Altenbernd, Hartwig Anzt, Leonardo Bautista-Gomez, Tommaso Benacchio, Luca Bonaventura, Hans-Joachim Bungartz, Sanjay Chatterjee, Florina M. Ciorba, Nathan DeBardeleben, Daniel Drzisga, Sebastian Eibl, Christian Engelmann, Wilfried N. Gansterer, Luc Giraud, Dominik Göddeke, Marco Heisig, Fabienne Jézéquel, Nils Kohl, Xiaoye Sherry Li, Romain Lion, Miriam Mehl, Paul Mycek, Michael Obersteiner, Enrique S. Quintana-Ortí, Francesco Rizzi, Ulrich Rüde, Martin Schulz, Fred Fung, Robert Speck, Linda Stals, Keita Teranishi, Samuel Thibault, Dominik Thönnes, Andreas Wagner, Barbara I. Wohlmuth:
  Resiliency in Numerical Algorithm Design for Extreme Scale Simulations. CoRR abs/2010.13342 (2020)
• 2019
• 
  Marc Casas, Wilfried N. Gansterer, Elias Wimmer:
  Resilient gossip-inspired all-reduce algorithms for high-performance computing: Potential, limitations, and open questions. Int. J. High Perform. Comput. Appl. 33(2) (2019)
• 
  Carlos Pachajoa, Markus Levonyak, Wilfried N. Gansterer, Jesper Larsson Träff:
  How to Make the Preconditioned Conjugate Gradient Method Resilient Against Multiple Node Failures. ICPP 2019: 67:1-67:10
• 
  Carlos Pachajoa, Christina Pacher, Wilfried N. Gansterer:
  Node-Failure-Resistant Preconditioned Conjugate Gradient Method without Replacement Nodes. FTXS@SC 2019: 31-40
• 
  Carlos Pachajoa, Markus Levonyak, Wilfried N. Gansterer, Jesper Larsson Träff:
  How to Make the Preconditioned Conjugate Gradient Method Resilient Against Multiple Node Failures. CoRR abs/1907.13077 (2019)
• 
  Markus Levonyak, Christina Pacher, Wilfried N. Gansterer:
  Scalable Resilience Against Node Failures for Communication-Hiding Preconditioned Conjugate Gradient and Conjugate Residual Methods. CoRR abs/1912.09230 (2019)
• 2018
• 
  Carlos Pachajoa, Markus Levonyak, Wilfried N. Gansterer:
  Extending and Evaluating Fault-Tolerant Preconditioned Conjugate Gradient Methods. FTXS@SC 2018: 49-58
• 2017
• 
  Michael Moldaschl, Karl E. Prikopa, Wilfried N. Gansterer:
  Fault tolerant communication-optimal 2.5D matrix multiplication. J. Parallel Distributed Comput. 104: 179-190 (2017)
• 
  Carlos Pachajoa, Wilfried N. Gansterer:
  On the Resilience of Conjugate Gradient and Multigrid Methods to Node Failures. Euro-Par Workshops 2017: 569-580
• 2016
• 
  Andreas Berger, Alessandro D'Alconzo, Wilfried N. Gansterer, Antonio Pescapè:
  Mining agile DNS traffic using graph analysis for cybercrime detection. Comput. Networks 100: 28-44 (2016)
• 
  Andrea Hess, Karin Anna Hummel, Wilfried N. Gansterer, Günter Haring:
  Data-driven Human Mobility Modeling: A Survey and Engineering Guidance for Mobile Networking. ACM Comput. Surv. 48(3): 38:1-38:39 (2016)
• 
  Ondrej Sluciak, Hana Straková, Markus Rupp, Wilfried N. Gansterer:
  Distributed Gram-Schmidt orthogonalization with simultaneous elements refinement. EURASIP J. Adv. Signal Process. 2016: 25 (2016)
• 
  Karl E. Prikopa, Wilfried N. Gansterer, Elias Wimmer:
  Parallel iterative refinement linear least squares solvers based on all-reduce operations. Parallel Comput. 57: 167-184 (2016)
• 
  Andreas Janecek, Wilfried N. Gansterer:
  ACO-inspired Acceleration of Gossip Averaging. GECCO 2016: 21-28
• 
  Andreas Janecek, Wilfried N. Gansterer:
  Understanding the Information Flow of ACO-Accelerated Gossip Algorithms. ICSI (1) 2016: 426-433
• 2015
• 
  Mukhtar Azeem, Majid Iqbal Khan, Samee Ullah Khan, Wilfried N. Gansterer:
  Efficient scheduling of sporadic tasks for real-time wireless sensor networks. IET Wirel. Sens. Syst. 5(1): 1-10 (2015)

skipping 64 more matches