default search action
Sumit Mishra
This is just a disambiguation page, and is not intended to be the bibliography of an actual person. Any publication listed on this page has not been assigned to an actual author yet. If you know the true author of one of the publications listed below, you are welcome to contact us.
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j17]Ved Prakash, Sumit Mishra:
Hierarchical non-dominated sort: analysis and improvement. Genet. Program. Evolvable Mach. 25(1): 14 (2024) - 2023
- [j16]Sumit Mishra, Praveen Kumar Rajendran, Luiz Felipe Vecchietti, Dongsoo Har:
Sensing Accident-Prone Features in Urban Scenes for Proactive Driving and Accident Prevention. IEEE Trans. Intell. Transp. Syst. 24(9): 9401-9414 (2023) - [c30]Ved Prakash, Sumit Mishra, Carlos A. Coello Coello:
On the Computational Complexity of Efficient Non-dominated Sort Using Binary Search. EMO 2023: 419-432 - [c29]Laizhong Cui, Sudipta Acharya, Sumit Mishra, Yi Pan, Joshua Zhexue Huang:
MMCo-Clus - An Evolutionary Co-clustering Algorithm for Gene Selection (Extended abstract). ICDE 2023: 3875-3876 - [i6]Sumit Mishra, Medhavi Mishra, Taeyoung Kim, Dongsoo Har:
Road Redesign Technique Achieving Enhanced Road Safety by Inpainting with a Diffusion Model. CoRR abs/2302.07440 (2023) - 2022
- [j15]Akash Yadav, Sumit Mishra, Ashok Singh Sairam:
A multi-objective worker selection scheme in crowdsourced platforms using NSGA-II. Expert Syst. Appl. 201: 116991 (2022) - [j14]Nilesh Chakraborty, Yao Chao, Jianqiang Li, Sumit Mishra, Chengwen Luo, Ying He, Jie Chen, Yi Pan:
RTT-Based Rogue UAV Detection in IoV Networks. IEEE Internet Things J. 9(8): 5909-5919 (2022) - [j13]Laizhong Cui, Sudipta Acharya, Sumit Mishra, Yi Pan, Joshua Zhexue Huang:
MMCo-Clus - An Evolutionary Co-clustering Algorithm for Gene Selection. IEEE Trans. Knowl. Data Eng. 34(9): 4371-4384 (2022) - [c28]Praveen Kumar Rajendran, Sumit Mishra, Luiz Felipe Vecchietti, Dongsoo Har:
RelMobNet: End-to-End Relative Camera Pose Estimation Using a Robust Two-Stage Training. ECCV Workshops (6) 2022: 238-252 - [c27]Paras Nigam, Sumit Mishra:
Counterexample to the best-case running time of efficient non-dominated sorting algorithm. GECCO Companion 2022: 798-800 - [c26]Sumit Mishra, Devanjan Bhattacharya, Atanshi Chaturvedi, Nikhil Singh:
Assessing micro-mobility services in pandemics for studying the 10-minutes cities concept in India using geospatial data analysis: an application. IWCTS@SIGSPATIAL 2022: 3:1-3:10 - [c25]Pranjay Shyam, Sumit Mishra, Kuk-Jin Yoon, Kyung-Soo Kim:
Infra Sim-to-Real: An efficient baseline and dataset for Infrastructure based Online Object Detection and Tracking using Domain Adaptation. IV 2022: 1393-1399 - [i5]Sumit Mishra, Praveen Kumar Rajendran, Luiz Felipe Vecchietti, Dongsoo Har:
Sensing accident-prone features in urban scenes for proactive driving and accident prevention. CoRR abs/2202.12788 (2022) - [i4]Praveen Kumar Rajendran, Sumit Mishra, Luiz Felipe Vecchietti, Dongsoo Har:
RELMOBNET: A Robust Two-Stage End-To-End Training Approach For MOBILENETV3 Based Relative Camera Pose Estimation. CoRR abs/2202.12838 (2022) - [i3]Sumit Mishra, Vishal Singh, Ankit Gupta, Devanjan Bhattacharya, Abhisek Mudgal:
Adaptive Traffic Signal Control for Developing Countries Using Fused Parameters Derived from Crowd-Source Data. CoRR abs/2205.01640 (2022) - 2021
- [j12]Sumit Mishra, Nikhil Singh, Devanjan Bhattacharya:
Application-Based COVID-19 Micro-Mobility Solution for Safe and Smart Navigation in Pandemics. ISPRS Int. J. Geo Inf. 10(8): 571 (2021) - [j11]Sumit Mishra, Carlos A. Coello Coello:
A parallel naive approach for non-dominated sorting: a theoretical study considering PRAM CREW model. Soft Comput. 25(1): 73-84 (2021) - [c24]Sumit Mishra, Srinibas Swain, Sangita Sarmah, Carlos A. Coello Coello:
Hypervolume by Slicing Objective Algorithm: An Improved Version. CEC 2021: 2451-2458 - [c23]Sumit Mishra, Ved Prakash, Maxim Buzdalov:
Labeling-oriented non-dominated sorting is Θ(MN3). GECCO Companion 2021: 189-190 - [c22]Sumit Mishra, Ved Prakash:
Time complexity analysis of the deductive sort in the best case. GECCO Companion 2021: 337-338 - [c21]Sumit Mishra, Praveen Kumar Rajendran, Dongsoo Har:
Socially Acceptable Route Planning and Trajectory Behavior Analysis of Personal Mobility Device for Mobility Management with Improved Sensing. RiTA 2021: 53-65 - [c20]Sumit Mishra, Sanjay Moulik, Ved Prakash:
Invalid Scenarios of External Cluster Validity Indices: An Analysis Using Bell Polynomial. SMC 2021: 2215-2220 - [i2]Sumit Mishra, Praveen Kumar Rajendran, Dongsoo Har:
Socially acceptable route planning and trajectory behavior analysis of personal mobility device for mobility management with improved sensing. CoRR abs/2112.03526 (2021) - 2020
- [c19]Sumit Mishra, Maxim Buzdalov, Rakesh Senwar:
Time complexity analysis of the dominance degree approach for non-dominated sorting. GECCO Companion 2020: 169-170 - [c18]Sumit Mishra, Maxim Buzdalov:
If unsure, shuffle: deductive sort is Θ(MN3), but O(MN2) in expectation over input permutations. GECCO 2020: 516-523 - [c17]Sumit Mishra, Maxim Buzdalov:
Filter Sort Is $\varOmega (N^3)$ in the Worst Case. PPSN (2) 2020: 675-685 - [c16]Sumit Mishra, Rakesh Senwar:
DDA-ENS: Dominance Degree Approach based Efficient Non-dominated Sort. SMC 2020: 1075-1080
2010 – 2019
- 2019
- [j10]Sumit Mishra, Carlos A. Coello Coello:
Parallelism in divide-and-conquer non-dominated sorting: a theoretical study considering the PRAM-CREW model. J. Heuristics 25(3): 455-483 (2019) - [j9]Sumit Mishra, Sriparna Saha, Samrat Mondal, Carlos A. Coello Coello:
A divide-and-conquer based efficient non-dominated sorting approach. Swarm Evol. Comput. 44: 748-773 (2019) - [j8]Sumit Mishra, Sriparna Saha, Samrat Mondal, Carlos A. Coello Coello:
Divide-and-conquer based non-dominated sorting with Reduced Comparisons. Swarm Evol. Comput. 51 (2019) - [c15]Sumit Mishra, Carlos A. Coello Coello:
An Approach for Non-domination Level Update Problem in Steady-State Evolutionary Algorithms With Parallelism. CEC 2019: 1006-1013 - [c14]Sumit Mishra, Carlos A. Coello Coello:
Parallel Best Order Sort for Non-dominated Sorting: A Theoretical Study Considering the PRAM-CREW Model. CEC 2019: 1022-1029 - [c13]Sumit Mishra, Akash Yadav, Ashok Singh Sairam:
Worker Selection in Crowd-sourced Platforms using Non-dominated Sorting. TENCON 2019: 41-45 - [c12]Sumit Mishra, Sriparna Saha, Samrat Mondal:
A Many Objective Optimization Based Entity Matching Framework for Bibliographic Database. TENCON 2019: 2054-2058 - 2018
- [j7]Sumit Mishra, Devanjan Bhattacharya, Ankit Gupta:
Congestion Adaptive Traffic Light Control and Notification Architecture Using Google Maps APIs. Data 3(4): 67 (2018) - [j6]Sumit Mishra, Samrat Mondal, Sriparna Saha:
Towards Obtaining Upper Bound on Sensitivity Computation Process for Cluster Validity Measures. Fundam. Informaticae 163(4): 351-374 (2018) - [j5]Sumit Mishra, Samrat Mondal, Sriparna Saha, Carlos A. Coello Coello:
GBOS: Generalized Best Order Sort algorithm for non-dominated sorting. Swarm Evol. Comput. 43: 244-264 (2018) - [c11]Sumit Mishra, Sriparna Saha, Samrat Mondal:
MBOS: Modified Best Order Sort Algorithm for Performing Non-Dominated Sorting. CEC 2018: 1-8 - [c10]Sumit Mishra, Carlos A. Coello Coello:
P-ENS: Parallelism in Efficient Non-Dominated Sorting. CEC 2018: 1-8 - [c9]Sumit Mishra, Vishal Singh, Devanjan Bhattacharya:
Framework for Freight Truck Return-Trip Assignment System. IC3 2018: 1-3 - [c8]Sumit Mishra, Sriparna Saha, Samrat Mondal:
An Approach to Obtain the Upper Bound on the Number of Non-dominated Fronts in a Population. ICACCI 2018: 1947-1951 - [c7]Sumit Mishra, Sriparna Saha, Samrat Mondal:
On Evaluation of Entity Matching Techniques for Bibliographic Database. ICACCI 2018: 2325-2331 - 2017
- [j4]Sumit Mishra, Sriparna Saha, Samrat Mondal:
GAEMTBD: Genetic algorithm based entity matching techniques for bibliographic databases. Appl. Intell. 47(1): 197-230 (2017) - [j3]Sumit Mishra, Samrat Mondal, Sriparna Saha:
Improved solution to the non-domination level update problem. Appl. Soft Comput. 60: 336-362 (2017) - [c6]Sumit Mishra, Sripama Saha, Samrat Mondal:
Unsupervised method to ensemble results of multiple clustering solutions for bibliographic data. CEC 2017: 1459-1466 - 2016
- [j2]Sumit Mishra, Sriparna Saha, Samrat Mondal:
A multiobjective optimization based entity matching technique for bibliographic databases. Expert Syst. Appl. 65: 100-115 (2016) - [j1]Sumit Mishra, Samrat Mondal, Sriparna Saha:
Sensitivity - An Important Facet of Cluster Validation Process for Entity Matching Technique. Trans. Large Scale Data Knowl. Centered Syst. 29: 1-39 (2016) - [c5]Sumit Mishra, Sriparna Saha, Samrat Mondal:
An automatic framework for entity matching in bibliographic databases. CEC 2016: 271-278 - [c4]Sumit Mishra, Samrat Mondal, Sriparna Saha:
Fast implementation of steady-state NSGA-II. CEC 2016: 3777-3784 - [c3]Sumit Mishra, Sriparna Saha, Samrat Mondal:
Divide and conquer based non-dominated sorting for parallel environment. CEC 2016: 4297-4304 - 2015
- [i1]Sumit Mishra, Samrat Mondal, Sriparna Saha:
Improved Solution to the Non-Domination Level Update Problem. CoRR abs/1510.04796 (2015) - 2014
- [c2]Sumit Mishra, Sriparna Saha, Samrat Mondal:
On Validation of Clustering Techniques for Bibliographic Databases. ICPR 2014: 3150-3155 - 2013
- [c1]Sumit Mishra, Samrat Mondal, Sriparna Saha:
Entity Matching Technique for Bibliographic Database. DEXA (2) 2013: 34-41
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-08 21:44 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint