Demo Data from EDBT 2026 / reviewers in the wild / expert
Pradeep Moturi
dblp:348/4910
· DBLP profile ↗
2ranked-venue papers
1as first author
2since 2021 · last 2025
—ORCID · unresolved
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 · 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.
| Artificial intelligence
1 paper |
Language models and text generation · 50% Knowledge representation and reasoning · 50% | |
| Software engineering, system software, and programming languages
1 paper |
Program synthesis and code generation · 100% |
Topics — the 2 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Natural language and speech › Language models and text generation
mathematical reasoning |
0.9 | 1 | 2025 | SBSC: Step-by-Step Coding for Improving Mathematical Olympiad Performance · ICLR 2025 |
Knowledge, reasoning and agents › Knowledge representation and reasoning › commonsense reasoning
script-based reasoning |
0.9 | 1 | 2025 | SBSC: Step-by-Step Coding for Improving Mathematical Olympiad Performance · ICLR 2025 |
Methods — techniques the papers use, named apart from their topics
large language model · 1.7chain-of-thought · 1.7
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | SBSC: Step-by-Step Coding for Improving Mathematical Olympiad PerformanceabstractWe propose Step-by-Step Coding (SBSC): a multi-turn math reasoning framework that enables Large Language Models (LLMs) to generate sequence of programs for solving Olympiad level math problems. After each turn/step, by leveraging the code execution outputs and programs of previous steps, the model generates the next sub-task and the corresponding program to complete it. This way, SBSC, sequentially navigates to reach the final answer. SBSC allows more granular, flexible and precise approach to problem-solving compared to existing methods. Extensive experiments highlight the effectiveness of SBSC in tackling competition and Olympiad-level math problems. For Claude-3.5-Sonnet, we observe SBSC (greedy decoding) surpasses existing state-of-the-art (SOTA) program generation based reasoning strategies by absolute 10.7% on AMC12, 8% on AIME and 12.6% on MathOdyssey. Given SBSC is multi-turn in nature, we also benchmark SBSC’s greedy decoding against self- consistency decoding results of existing SOTA math reasoning strategies and observe performance gain by absolute 6.2% on AMC, 6.7% on AIME and 7.4% on MathOdyssey. Kunal Singh, Ankan Biswas, Sayandeep Bhowmick, Pradeep Moturi, Siva Kishore Gollapalli |
ICLR | 4 |
| 2023 | YOLO-MAXVOD for Real-Time Video Object DetectionabstractVideo Object Detection (VOD) is one of the fundamental problems in video understanding with applications ranging from surveillance to autonomous driving. But many such real-world applications are unable to leverage the existing VOD models owing to their higher computational complexity which reduces inference speed. Single-stage still-image object detection models are naively used without any use of video information. In this paper, we present YOLOX based VOD model, YOLO-MaxVOD, which provides a better trade-off between accuracy and inference time than the current real-time VOD solutions. Specifically, we propose a temporal fusion module that integrates within the YOLOX architecture to take advantage of the high speed that the YOLOX model offers. In our experimentation on the Imagenet-VID dataset, we show that YOLO-MaxVOD shows 4.4-5.6% AP50 improvement over the baseline YOLOX, across different versions, with just a 1-2 ms increase in latency on NVIDIA 1080Ti GPU. Pradeep Moturi, Mukund Khanna, Kunal Singh |
ICIP | 1 |