Sumit Mishra

Orcid: 0000-0003-0330-4678

According to our database1, Sumit Mishra authored at least 50 papers between 2013 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Hierarchical non-dominated sort: analysis and improvement.
Genet. Program. Evolvable Mach., June, 2024

2023
Sensing Accident-Prone Features in Urban Scenes for Proactive Driving and Accident Prevention.
IEEE Trans. Intell. Transp. Syst., September, 2023

Road Redesign Technique Achieving Enhanced Road Safety by Inpainting with a Diffusion Model.
CoRR, 2023

MMCo-Clus - An Evolutionary Co-clustering Algorithm for Gene Selection (Extended abstract).
Proceedings of the 39th IEEE International Conference on Data Engineering, 2023

On the Computational Complexity of Efficient Non-dominated Sort Using Binary Search.
Proceedings of the Evolutionary Multi-Criterion Optimization, 2023

2022
MMCo-Clus - An Evolutionary Co-clustering Algorithm for Gene Selection.
IEEE Trans. Knowl. Data Eng., 2022

RTT-Based Rogue UAV Detection in IoV Networks.
IEEE Internet Things J., 2022

A multi-objective worker selection scheme in crowdsourced platforms using NSGA-II.
Expert Syst. Appl., 2022

Adaptive Traffic Signal Control for Developing Countries Using Fused Parameters Derived from Crowd-Source Data.
CoRR, 2022

RELMOBNET: A Robust Two-Stage End-To-End Training Approach For MOBILENETV3 Based Relative Camera Pose Estimation.
CoRR, 2022

Infra Sim-to-Real: An efficient baseline and dataset for Infrastructure based Online Object Detection and Tracking using Domain Adaptation.
Proceedings of the 2022 IEEE Intelligent Vehicles Symposium, 2022

Assessing micro-mobility services in pandemics for studying the 10-minutes cities concept in India using geospatial data analysis: an application.
Proceedings of the 15th ACM SIGSPATIAL International Workshop on Computational Transportation Science, 2022

Counterexample to the best-case running time of efficient non-dominated sorting algorithm.
Proceedings of the GECCO '22: Genetic and Evolutionary Computation Conference, Companion Volume, Boston, Massachusetts, USA, July 9, 2022

RelMobNet: End-to-End Relative Camera Pose Estimation Using a Robust Two-Stage Training.
Proceedings of the Computer Vision - ECCV 2022 Workshops, 2022

2021
A parallel naive approach for non-dominated sorting: a theoretical study considering PRAM CREW model.
Soft Comput., 2021

Application-Based COVID-19 Micro-Mobility Solution for Safe and Smart Navigation in Pandemics.
ISPRS Int. J. Geo Inf., 2021

Invalid Scenarios of External Cluster Validity Indices: An Analysis Using Bell Polynomial.
Proceedings of the 2021 IEEE International Conference on Systems, Man, and Cybernetics, 2021

Socially Acceptable Route Planning and Trajectory Behavior Analysis of Personal Mobility Device for Mobility Management with Improved Sensing.
Proceedings of the Robot Intelligence Technology and Applications 6, 2021

Labeling-oriented non-dominated sorting is Θ(<i>MN</i><sup>3</sup>).
Proceedings of the GECCO '21: Genetic and Evolutionary Computation Conference, 2021

Time complexity analysis of the deductive sort in the best case.
Proceedings of the GECCO '21: Genetic and Evolutionary Computation Conference, 2021

Hypervolume by Slicing Objective Algorithm: An Improved Version.
Proceedings of the IEEE Congress on Evolutionary Computation, 2021

2020
DDA-ENS: Dominance Degree Approach based Efficient Non-dominated Sort.
Proceedings of the 2020 IEEE International Conference on Systems, Man, and Cybernetics, 2020

Filter Sort Is $\varOmega (N^3)$ in the Worst Case.
Proceedings of the Parallel Problem Solving from Nature - PPSN XVI, 2020

Time complexity analysis of the dominance degree approach for non-dominated sorting.
Proceedings of the GECCO '20: Genetic and Evolutionary Computation Conference, 2020

If unsure, shuffle: deductive sort is Θ(<i>MN</i><sup>3</sup>), but <i>O</i>(<i>MN</i><sup>2</sup>) in expectation over input permutations.
Proceedings of the GECCO '20: Genetic and Evolutionary Computation Conference, 2020

2019
Divide-and-conquer based non-dominated sorting with Reduced Comparisons.
Swarm Evol. Comput., 2019

A divide-and-conquer based efficient non-dominated sorting approach.
Swarm Evol. Comput., 2019

Parallelism in divide-and-conquer non-dominated sorting: a theoretical study considering the PRAM-CREW model.
J. Heuristics, 2019

Worker Selection in Crowd-sourced Platforms using Non-dominated Sorting.
Proceedings of the TENCON 2019, 2019

A Many Objective Optimization Based Entity Matching Framework for Bibliographic Database.
Proceedings of the TENCON 2019, 2019

Parallel Best Order Sort for Non-dominated Sorting: A Theoretical Study Considering the PRAM-CREW Model.
Proceedings of the IEEE Congress on Evolutionary Computation, 2019

An Approach for Non-domination Level Update Problem in Steady-State Evolutionary Algorithms With Parallelism.
Proceedings of the IEEE Congress on Evolutionary Computation, 2019

2018
GBOS: Generalized Best Order Sort algorithm for non-dominated sorting.
Swarm Evol. Comput., 2018

Towards Obtaining Upper Bound on Sensitivity Computation Process for Cluster Validity Measures.
Fundam. Informaticae, 2018

Congestion Adaptive Traffic Light Control and Notification Architecture Using Google Maps APIs.
Data, 2018

On Evaluation of Entity Matching Techniques for Bibliographic Database.
Proceedings of the 2018 International Conference on Advances in Computing, 2018

An Approach to Obtain the Upper Bound on the Number of Non-dominated Fronts in a Population.
Proceedings of the 2018 International Conference on Advances in Computing, 2018

Framework for Freight Truck Return-Trip Assignment System.
Proceedings of the 2018 Eleventh International Conference on Contemporary Computing, 2018

P-ENS: Parallelism in Efficient Non-Dominated Sorting.
Proceedings of the 2018 IEEE Congress on Evolutionary Computation, 2018

MBOS: Modified Best Order Sort Algorithm for Performing Non-Dominated Sorting.
Proceedings of the 2018 IEEE Congress on Evolutionary Computation, 2018

2017
Improved solution to the non-domination level update problem.
Appl. Soft Comput., 2017

GAEMTBD: Genetic algorithm based entity matching techniques for bibliographic databases.
Appl. Intell., 2017

Unsupervised method to ensemble results of multiple clustering solutions for bibliographic data.
Proceedings of the 2017 IEEE Congress on Evolutionary Computation, 2017

2016
Sensitivity - An Important Facet of Cluster Validation Process for Entity Matching Technique.
Trans. Large Scale Data Knowl. Centered Syst., 2016

A multiobjective optimization based entity matching technique for bibliographic databases.
Expert Syst. Appl., 2016

Fast implementation of steady-state NSGA-II.
Proceedings of the IEEE Congress on Evolutionary Computation, 2016

Divide and conquer based non-dominated sorting for parallel environment.
Proceedings of the IEEE Congress on Evolutionary Computation, 2016

An automatic framework for entity matching in bibliographic databases.
Proceedings of the IEEE Congress on Evolutionary Computation, 2016

2014
On Validation of Clustering Techniques for Bibliographic Databases.
Proceedings of the 22nd International Conference on Pattern Recognition, 2014

2013
Entity Matching Technique for Bibliographic Database.
Proceedings of the Database and Expert Systems Applications, 2013


  Loading...