Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data.

Daniel Weinberg

dblp:176/5074 · DBLP profile ↗
← Back
6ranked-venue papers
0as first author
5since 2021 · last 2025
—ORCID · conflict

Domains — the database's venue-derived domains; a paper can count in several

Applied, interdisciplinary, general and emerging computing · 5 · 4 since 2021Databases, data management, data science and information retrieval · 2 · 2 since 2021Artificial intelligence and machine learning · 1 · 1 since 2021Systems, architecture and hardware · 1 · 1 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.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
High-performance computing · 75% Emerging computing paradigms · 25%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Computational science and engineering · 100%

Topics — the 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
High-performance computing › supercomputing
exascale computing
0.912025
Advancing Quantum Many-Body GW Calculations on Exascale Supercomputing Platforms · SC 2025
High-performance computing › performance engineering
performance portability
0.912025
Advancing Quantum Many-Body GW Calculations on Exascale Supercomputing Platforms · SC 2025
Emerging computing paradigms › quantum computing › quantum simulation
quantum many-body simulation
0.912025
Advancing Quantum Many-Body GW Calculations on Exascale Supercomputing Platforms · SC 2025
High-performance computing
scientific computing systems
0.912025
Advancing Quantum Many-Body GW Calculations on Exascale Supercomputing Platforms · SC 2025
Computational science and engineering › materials science
materials science simulation
0.312025
Advancing Quantum Many-Body GW Calculations on Exascale Supercomputing Platforms · SC 2025

Methods — techniques the papers use, named apart from their topics

GW approximation · 1.7
YearPublicationVenuePosition
2025 Double Metaphone Blocking: An Innovative Blocking Approach to Record Linkage
Nidhibahen Shah, Joyanta Basak, Sartaj Sahni, Anup Mathur, Krista Park, Daniel Weinberg, Sanguthevar Rajasekaran
ISBRA (2)6
2025 Advancing Quantum Many-Body GW Calculations on Exascale Supercomputing Platforms
abstract
Advanced ab initio materials simulations face growing challenges as increasing systems and phenomena complexity requires higher accuracy, driving up computational demands. Quantum many-body GW methods are state-of-the-art for treating electronic excited states and couplings but often hindered due to the costly numerical complexity. Here, we present innovative implementations of advanced GW methods within the BerkeleyGW package, enabling large-scale simulations on Frontier and Aurora exascale platforms. Our approach demonstrates exceptional versatility for complex heterogeneous systems with up to 17,574 atoms, along with achieving true performance portability across GPU architectures. We demonstrate excellent strong and weak scaling to thousands of nodes, reaching double-precision core-kernel performance of 1.069 ExaFLOP/s on Frontier (9,408 nodes) and 707.52 PetaFLOP/s on Aurora (9,600 nodes), corresponding to 59.45% and 48.79% of peak, respectively. Our work demonstrates a breakthrough in utilizing exascale computing for quantum materials simulations, delivering unprecedented predictive capabilities for rational designs of future quantum technologies.
Benran Zhang, Daniel Weinberg, Chih-En Hsu, Aaron R. Altman, James B. White, Derek Vigil-Fowler, Steven G. Louie, Jack Deslippe, Felipe H. da Jornada, Zhenglu Li, Mauro Del Ben
SC2
2024 The Soundex Blocking: A Novel Blocking Approach for Record Linkage
abstract
The problem of record linkage is to cluster the records from several data sources such that each cluster has all the records belonging to one and only one entity. Record linkage has applications in a wide variety of domains including public health, law enforcement, fraud detection, biology, and transportation. Given the typically vast sizes of datasets, existing algorithms suffer from very long runtimes. Hence, it is essential to develop novel algorithms tailored to address this issue. Blocking is a popular technique employed to speed up record linkage algorithms. In this paper, we employ a blocking technique that is based on Soundex encoding. Soundex index is a method of coding names based on their pronunciation rather than their spelling. Soundex has been traditionally used only as a distance metric. In this paper, we show how to use Soundex as a blocking technique. To the best of our knowledge, no one else has done it in the past. In fact, we introduce two novel blocking approaches that utilize Soundex encoding: One stage Soundex blocking and Two stage Soundex blocking.Our approaches exhibit superior linkage performance compared to the state-of-the-art record linkage algorithms, as evidenced by higher F-1 scores and reduced linkage times. The proposed blocking approaches prove to be highly effective.
Nidhibahen Shah, Ahmed Soliman 0003, Joyanta Basak, Sartaj Sahni, Kenneth Haase, Anup Mathur, Krista Park, Daniel Weinberg, Sanguthevar Rajasekaran
IEEE Big Data8
2023 Novel Blocking Techniques and Distance Metrics for Record Linkage
Nachiket Deo, Joyanta Basak, Ahmed Soliman 0003, Daniel Weinberg, Rebecca C. Steorts, Sanguthevar Rajasekaran
iiWAS4
2023 On Computing the Jaro Similarity Between Two Strings
Joyanta Basak, Ahmed Soliman 0003, Nachiket Deo, Kenneth Haase, Anup Mathur, Krista Park, Rebecca C. Steorts, Daniel Weinberg, Sartaj Sahni, Sanguthevar Rajasekaran
ISBRA8
2018 Superresolution of Noisy Remotely Sensed Images Through Directional Representations
abstract
We develop an algorithm for single-image superresolution of remotely sensed data based on the discrete shearlet transform. The shearlet transform extracts directional features of signals and is known to provide near-optimally sparse representations for a broad class of images. This often leads to superior performance in edge detection and image representation when compared with isotropic frames. We justify the use of shearlets mathematically, before presenting a denoising single-image superresolution algorithm that combines the shearlet transform with sparse mixing estimators (SMEs). Our algorithm is compared with a variety of single-image superresolution methods, including wavelet SME superresolution. Our numerical results demonstrate competitive performance in terms of peak-signal-to-noise ratio and structural similarity index metric.
Wojciech Czaja, James M. Murphy, Daniel Weinberg
IEEE Geosci. Remote. Sens. Lett.3