default search action
Milan D. Parmar
Person information
- affiliation: University of Tennessee at Knoxville, Department of Electrical Engineering and Computer Science, TN, USA
- affiliation (2022 - 2023): Mississippi State University, College of Engineering, Starkville, MS, USA
- affiliation (2016 - 2022): Jilin University of Finance and Economics, School of Management Science and Information Engineering, Changchun, China
- affiliation (PhD 2019): Jilin University, School of Applied Computer Science and Technology, Changchun, China
- affiliation (former): Hunan University of Arts and Science, Changde, China
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j10]Alexander Sommers
, Shahram Rahimi
A Hybrid Expert System for Estimation of the Manufacturability of a Notional Design. Appl. Comput. Intell. Soft Comput. 2024: 4985090:1-4985090:17 (2024) - [j9]Xia Zhao, Limin Wang, Yufei Zhang
A review of convolutional neural networks in computer vision. Artif. Intell. Rev. 57(4): 99 (2024) - 2023
- [i2]Subash Neupane, Ivan A. Fernandez, Wilson Patterson, Sudip Mittal, Milan D. Parmar, Shahram Rahimi:
TwinExplainer: Explaining Predictions of an Automotive Digital Twin. CoRR abs/2302.00152 (2023) - 2022
- [i1]Wilson Patterson, Ivan A. Fernandez, Subash Neupane, Milan D. Parmar, Sudip Mittal, Shahram Rahimi:
A White-Box Adversarial Attack Against a Digital Twin. CoRR abs/2210.14018 (2022) - 2021
- [j8]Limin Wang, Wenjing Sun, Xuming Han
An Improved Integrated Clustering Learning Strategy Based on Three-Stage Affinity Propagation Algorithm with Density Peak Optimization Theory. Complex. 2021: 6666619:1-6666619:12 (2021)
2010 – 2019
- 2019
- [j7]Milan Deepak Parmar
FREDPC: A Feasible Residual Error-Based Density Peak Clustering Algorithm With the Fragment Merging Strategy. IEEE Access 7: 89789-89804 (2019) - [j6]Limin Wang
A Novel Density Peaks Clustering Halo Node Assignment Method Based on K-Nearest Neighbor Theory. IEEE Access 7: 174380-174390 (2019) - [j5]Milan Deepak Parmar
REDPC: A residual error-based density peak clustering algorithm. Neurocomputing 348: 82-96 (2019) - 2018
- [j4]Zhuoxi Yu, Kai Yang, Milan Deepak Parmar
Empirical likelihood based inference for generalized additive partial linear models. Appl. Math. Comput. 339: 105-112 (2018) - 2017
- [j3]Chijun Zhang, Zhanwei Du, Milan Deepak Parmar
Pocket-switch-network based services optimization in crowdsourced delivery systems. Comput. Electr. Eng. 62: 53-63 (2017) - [c1]Milan Deepak Parmar
A novel density peak clustering algorithm based on squared residual error. SPAC 2017: 43-48 - 2016
- [j2]Zhuoxi Yu, Yujia Jin, Milan Deepak Parmar
Application of Modified OPTICS Algorithm in E-Commerce Sites Classification and Evaluation. J. Electron. Commer. Organ. 14(1): 64-75 (2016) - [j1]Jianhua Jiang
FP-ABC: Fast and Parallel ABC Based Energy-Efficiency Live VM Allocation Policy in Data Centers. Sci. Program. 2016: 9524379:1-9524379:9 (2016)
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 2025-04-30 22:02 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: