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. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Victor May

dblp:156/0169 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
1since 2021 · last 2026
—ORCID · none

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

Artificial intelligence and machine learning · 1 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author

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.

Software engineering, system software, and programming languages
1 paper
Program synthesis and code generation · 77% Software maintenance and evolution · 23%
Computer graphics and multimedia
1 paper
Image and video processing · 100%

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

TopicWeightPapersLastEvidence papers
Software maintenance and evolution › software compatibility
library version compatibility
0.312026
GitChameleon 2.0: Evaluating AI Code Generation Against Python Library Version Incompatibilities · ACL (1) 2026
Image and video processing › image restoration
image denoising
0.212016
An Algorithm for Improving Non-Local Means Operators via Low-Rank Approximation · IEEE Trans. Image Process. 2016
Image and video processing › image restoration › image denoising › patch-based denoising
non-local means
0.212016
An Algorithm for Improving Non-Local Means Operators via Low-Rank Approximation · IEEE Trans. Image Process. 2016

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

retrieval-augmented generation · 1.0large language model · 1.0low-rank approximation · 0.2chebyshev polynomial approximation · 0.2
YearPublicationVenuePosition
2026 GitChameleon 2.0: Evaluating AI Code Generation Against Python Library Version Incompatibilities
abstract
The rapid evolution of software libraries poses a considerable hurdle for code generation, necessitating continuous adaptation to frequent version updates while preserving backward compatibility. While existing code evolution benchmarks provide valuable insights, they typically lack execution-based evaluation for generating code compliant with specific library versions. To address this, we introduce GitChameleon 2.0, a novel, meticulously curated dataset comprising 328 Python code completion problems, each conditioned on specific library versions and accompanied by executable unit tests. GitChameleon 2.0 rigorously evaluates the capacity of contemporary large language models (LLMs), LLM-powered agents, code assistants, and RAG systems to perform version-conditioned code generation that demonstrates functional accuracy through execution. Our extensive evaluations indicate that state-of-the-art systems encounter significant challenges with this task; enterprise models achieving baseline success rates in the 48-51% range, underscoring the intricacy of the problem. By offering an execution-based benchmark emphasizing the dynamic nature of code libraries, GitChameleon 2.0 enables a clearer understanding of this challenge and helps guide the development of more adaptable and dependable AI code generation methods.
Diganta Misra, Nizar Islah, Victor May, Brice Rauby, Justine Gehring, Antonio Orvieto, Muawiz Chaudhary, Eilif B. Muller, Irina Rish, Samira Ebrahimi Kahou, Massimo Caccia
ACL (1)3
2016 An Algorithm for Improving Non-Local Means Operators via Low-Rank Approximation
abstract
We present a method for improving a non-local means (NLM) operator by computing its low-rank approximation. The low-rank operator is constructed by applying a filter to the spectrum of the original NLM operator. This results in an operator, which is less sensitive to noise while preserving important properties of the original operator. The method is efficiently implemented based on Chebyshev polynomials and is demonstrated on the application of natural images denoising. For this application, we provide a comparison of our method with other denoising methods.
Victor May, Yosi Keller, Nir Sharon, Yoel Shkolnisky
IEEE Trans. Image Process.1