Demo Data from EDBT 2026 / reviewers in the wild / expert
Valéry Weber
dblp:86/5323
· DBLP profile ↗
5ranked-venue papers
1as first author
2since 2021 · last 2025
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 3 · 1 first-authorArtificial intelligence and machine learning · 2 · 2 since 2021Graphics, computer vision, multimedia, augmented reality and games · 2 · 2 since 2021
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Artificial intelligence
2 papers |
Information extraction and text analysis · 50% Graph learning · 30% Vision and language · 20% | |
| Computer architecture, parallel and distributed computing, and storage systems
1 paper |
High-performance computing · 100% | |
| Interdisciplinary, comprehensive, and emerging computing
2 papers |
Computational science and engineering · 56% Bioinformatics and computational biology · 44% |
Topics — the 9 heaviest of 10, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Natural language and speech › Information extraction and text analysis › document understanding › document image analysis
chemical structure recognition |
1.5 | 2 | 2025 | MarkushGrapher: Joint Visual and Textual Recognition of Markush Structures · CVPR 2025 MolGrapher: Graph-based Visual Recognition of Chemical Structures · ICCV 2023 |
Computer vision › Vision and language › multimodal understanding
multimodal document understanding |
0.9 | 1 | 2025 | MarkushGrapher: Joint Visual and Textual Recognition of Markush Structures · CVPR 2025 |
Machine learning › Graph learning
graph neural network |
0.7 | 1 | 2023 | MolGrapher: Graph-based Visual Recognition of Chemical Structures · ICCV 2023 |
Machine learning › Graph learning › graph neural network › node classification
graph node classification |
0.7 | 1 | 2023 | MolGrapher: Graph-based Visual Recognition of Chemical Structures · ICCV 2023 |
Natural language and speech › Information extraction and text analysis › document understanding › document image analysis
optical chemical structure recognition |
0.7 | 1 | 2023 | MolGrapher: Graph-based Visual Recognition of Chemical Structures · ICCV 2023 |
Computational science and engineering
computational chemistry |
0.2 | 1 | 2016 | Enhanced MPSM3 for applications to quantum biological simulations · SC 2016 |
High-performance computing › sparse linear algebra
sparse matrix computation |
0.2 | 1 | 2016 | Enhanced MPSM3 for applications to quantum biological simulations · SC 2016 |
High-performance computing › sparse linear algebra
sparse matrix multiplication |
0.2 | 1 | 2016 | Enhanced MPSM3 for applications to quantum biological simulations · SC 2016 |
Bioinformatics and computational biology › molecular informatics
cheminformatics |
0.2 | 1 | 2023 | MolGrapher: Graph-based Visual Recognition of Chemical Structures · ICCV 2023 |
Methods — techniques the papers use, named apart from their topics
synthetic data generation · 1.3graph neural network · 1.3deep keypoint detection · 1.3vision-text-layout encoder · 0.9optical chemical structure recognition · 0.9autoregressive generation · 0.9self-consistent field method · 0.5density matrix multiplication · 0.5
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | MarkushGrapher: Joint Visual and Textual Recognition of Markush StructuresabstractThe automated analysis of chemical literature holds promise to accelerate discovery in fields such as material science and drug development. In particular, search capabilities for chemical structures and Markush structures (chemical structure templates) within patent documents are valuable, e.g., for prior-art search. Advancements have been made in the automatic extraction of chemical structures from text and images, yet the Markush structures remain largely unexplored due to their complex multi-modal nature. In this work, we present MarkushGrapher, a multimodal approach for recognizing Markush structures in documents. Our method jointly encodes text, image, and layout information through a Vision-Text-Layout encoder and an Optical Chemical Structure Recognition vision encoder. These representations are merged and used to autoregressively generate a sequential graph representation of the Markush structure along with a table defining its variable groups. To overcome the lack of real-world training data, we propose a synthetic data generation pipeline that produces a wide range of realistic Markush structures. Additionally, we present M2S, the first annotated benchmark of real-world Markush structures, to advance research on this challenging task. Extensive experiments demonstrate that our approach outperforms state-of-the-art chemistry-specific and general-purpose vision-language models in most evaluation settings. Code, models, and datasets are available1. Lucas Morin, Valéry Weber, Gerhard Ingmar Meijer, Luc Van Gool, Yawei Li 0001, Peter W. J. Staar |
CVPR | 2 |
| 2023 | MolGrapher: Graph-based Visual Recognition of Chemical StructuresabstractThe automatic analysis of chemical literature has immense potential to accelerate the discovery of new materials and drugs. Much of the critical information in patent documents and scientific articles is contained in figures, depicting the molecule structures. However, automatically parsing the exact chemical structure is a formidable challenge, due to the amount of detailed information, the diversity of drawing styles, and the need for training data. In this work, we introduce MolGrapher to recognize chemical structures visually. First, a deep keypoint detector detects the atoms. Second, we treat all candidate atoms and bonds as nodes and put them in a graph. This construct allows a natural graph representation of the molecule. Last, we classify atom and bond nodes in the graph with a Graph Neural Network. To address the lack of real training data, we propose a synthetic data generation pipeline producing diverse and realistic results. In addition, we introduce a large-scale benchmark of annotated real molecule images, USPTO-30K, to spur research on this critical topic. Extensive experiments on five datasets show that our approach significantly outperforms classical and learning-based methods in most settings. Code, models, and datasets are available1. Lucas Morin, Martin Danelljan, Maria Isabel Agea, Ahmed S. Nassar, Valéry Weber, Gerhard Ingmar Meijer, Peter W. J. Staar, Fisher Yu 0001 |
ICCV | 5 |
| 2016 | Enhanced MPSM3 for applications to quantum biological simulationsabstractClassical molecular dynamics simulations have been the preferred method to cope with the characteristic sizes and time scales of complex life-science systems. However, while classical methods have well known limitations, such as that their accuracy strongly depends on empirical tuning, the practical use of far more accurate methods that rely on quantum Hamiltonians, has been limited by the current efficiency and scalability of sparse matrix-matrix multiplication algorithms used in the self-consistent field equations. In this paper, we show unprecedented massive scalability of a recently presented method, called MPSM3, for sparse matrix-matrix multiplication. The algorithmic basis of the method was presented in a recent publication, while here we describe the algorithmic enhancements that allow us to claim at least one order of magnitude improvement in scalability and time to solution over the state of the art (original MPSM3). We achieve a time to solution for the multiplication of density matrices within the self-consistent field scheme that is approaching the time needed to evaluate energy and forces with classical force-field methods and that is independent from the system size, provided proportional resources. This latest development renders the application of entirely quantum Hamiltonians to systems of several millions of atoms for extended molecular dynamics investigations feasible. A. Pozdneev, Valéry Weber, Teodoro Laino, Costas Bekas, Alessandro Curioni |
SC | 2 |
| 2014 | Shedding Light on Lithium/Air Batteries Using Millions of Threads on the BG/Q SupercomputerabstractIn this work, we present a novel parallelization scheme for a highly efficient evaluation of the Hartree-Fock exact exchange (HFX) in ab initio molecular dynamics simulations, specifically tailored for condensed phase simulations. Our developments allow one to achieve the necessary accuracy for the evaluation of the HFX in a highly controllable manner. We show here that our solutions can take great advantage of the latest trends in HPC platforms, such as extreme threading, short vector instructions and highly dimensional interconnection networks. Indeed, all these trends are evident in the IBM Blue Gene/Q supercomputer. We demonstrate an unprecedented scalability up to 6,291,456 threads (96 BG/Q racks) with a near perfect parallel efficiency, which represents a more than 20-fold improvement as compared to the current state of the art. In terms of reduction of time to solution, we achieved an improvement that can surpass a 10-fold decrease in runtime with respect to directly comparable approaches. We exploit this development to enhance the accuracy of DFT based molecular dynamics by using the PBE0 hybrid functional. This approach allowed us to investigate the chemical behavior of organic solvents in one of the most challenging research topics in energy storage, lithium/air batteries, and to propose alternative solvents with enhanced stability to ensure an appropriate reversible electrochemical reaction. This step is key for the development of a viable lithium/air storage technology, which would have been a daunting computational task using standard methods. Recent research has shown that the electrolyte plays a key role in non-aqueous lithium/air batteries in producing the appropriate reversible electrochemical reduction. In particular, the chemical degradation of propylene carbonate, the typical electrolyte used, by lithium peroxide has been demonstrated by molecular dynamics simulations of highly realistic models. Reaching the necessary high accuracy in these simulations is a daunting computational task using standard methods. Valéry Weber, Costas Bekas, Teodoro Laino, Alessandro Curioni, Adam Bertsch, Scott Futral |
IPDPS | 1 |
| 2014 | Sparse matrix multiplication: The distributed block-compressed sparse row library
Urban Borstnik, Joost VandeVondele, Valéry Weber, Jürg Hutter |
Parallel Comput. | 3 |