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

Harshit Sureka

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

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

Artificial intelligence and machine learning · 1 · 1 first-authorSystems, architecture and hardware · 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.

Computer graphics and multimedia
1 paper
Image and video processing · 100%

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

TopicWeightPapersLastEvidence papers
Image and video processing › image matching
patch matching
0.112012
Mixed-Resolution Patch-Matching · ECCV (6) 2012
Image and video processing
image restoration
0.012012
Mixed-Resolution Patch-Matching · ECCV (6) 2012

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

mixed-resolution matching · 0.1
YearPublicationVenuePosition
2025 Efficient profit maximization in reliability concerned static vehicular cloud system
abstract
Modern vehicles are equipped with high-performance compute systems. These compute resources mostly stay idle as most of the time vehicles get parked in the parking lots. In this work, we propose to utilize the unused compute resources of the vehicles efficiently to enhance the computing power of regular cloud systems , which is termed as vehicular cloud . Unlike in traditional cloud computing resources, the vehicles or vehicular compute resources move in or out of the parking lot, which introduces dynamic nature of the available compute resources. This makes it challenging for the vehicular cloud to ensure reliability of execution of the user-submitted tasks. In this work, we propose an approach to maximize the profit of the vehicular cloud by ensuring the reliability of the vehicular cloud. We consider user-submitted tasks with execution time , deadline and revenue associated with it. Our approach classifies the tasks based on the deadline, and orders the tasks for task admission based on the expected profit of the task. We also perform the classification of available vehicular units based on the expected residency time of vehicles and use the same for allocating vehicular units for redundant execution of task to ensure higher reliability. As the task execution time has a direct impact on redundancy requirements to ensure higher reliability, we convert the longer tasks to a chain of shorter sub-tasks to reduce the redundancy requirement. Our experiments show that the proposed approach outperforms the state-of-the-art approach with a profit margin increasing up to 25 to 45 % in real-life scenarios.The codes and dataset for this work are available at our https://github.com/SuvarthiSarkar/Efficient-profit-maximization-in-reliability-concerned-static-vehicular-cloud-system.git GitHub repository.
Suvarthi Sarkar, Akshat Arun, Harshit Sureka, Aryabartta Sahu
Future Gener. Comput. Syst.3
2012 Mixed-Resolution Patch-Matching
Harshit Sureka, P. J. Narayanan
ECCV (6)1