| Computational Prediction of Cervical Cancer Diagnosis Using Ensemble-Based Classification Algorithm | 0 | 0.34 | 2022 |
| Improved Hybrid Bag-Boost Ensemble With K-Means-SMOTE–ENN Technique for Handling Noisy Class Imbalanced Data | 0 | 0.34 | 2022 |
| Simple dynamic algorithms for Maximal Independent Set, Maximum Flow and Maximum Matching. | 0 | 0.34 | 2021 |
| Knowledge discovery from noisy imbalanced and incomplete binary class data | 0 | 0.34 | 2021 |
| Artificial Neural Networks to Solve the Singular Model with Neumann-Robin, Dirichlet and Neumann Boundary Conditions | 0 | 0.34 | 2021 |
| Computational Intelligent Paradigms To Solve The Nonlinear Sir System For Spreading Infection And Treatment Using Levenberg-Marquardt Backpropagation | 0 | 0.34 | 2021 |
| A Stochastic Intelligent Computing with Neuro-Evolution Heuristics for Nonlinear SITR System of Novel COVID-19 Dynamics. | 1 | 0.35 | 2020 |
| A comprehensive review of feature based methods for drug target interaction prediction. | 2 | 0.37 | 2019 |
| Generic Single Edge Fault Tolerant Exact Distance Oracle. | 0 | 0.34 | 2018 |
| Nearly Optimal Space Efficient Algorithm for Depth First Search. | 0 | 0.34 | 2018 |
| Simple dynamic algorithms for Maximal Independent Set and other problems. | 0 | 0.34 | 2018 |
| Fully Dynamic Maximal Matching in O(log n) Update Time (Corrected Version). | 3 | 0.39 | 2018 |
| Multiple Source Dual Fault Tolerant BFS Trees. | 1 | 0.37 | 2017 |
| Improved Algorithm for Dynamic b-Matching. | 0 | 0.34 | 2017 |
| CAPReS: Context Aware Persona Based Recommendation for Shoppers. | 1 | 0.35 | 2016 |
| Cell Design and Routing of Jobs in a Multisite Make-to-Order Enterprise. | 0 | 0.34 | 2016 |
| The robust knapsack problem with queries. | 0 | 0.34 | 2015 |
| Simple and Faster algorithm for Reachability in a Decremental Directed Graph. | 0 | 0.34 | 2015 |
| Maintaining Approximate Maximum Matching in an Incremental Bipartite Graph in Polylogarithmic Update Time. | 0 | 0.34 | 2014 |
| Fully Dynamic (1+ e)-Approximate Matchings | 22 | 1.09 | 2013 |
| Maintaining Approximate Maximum Weighted Matching in Fully Dynamic Graphs | 1 | 0.36 | 2012 |
| On Dynamic Optimality for Binary Search Trees | 2 | 0.42 | 2011 |
| The update complexity of selection and related problems | 5 | 0.50 | 2011 |
| Fully Dynamic Maximal Matching in O(log n) Update Time. | 29 | 1.25 | 2011 |
| A low cost split-issue technique to improve performance of SMT clustered VLIW processors | 1 | 0.39 | 2010 |
| CSMT: Simultaneous Multithreading for Clustered VLIW Processors | 1 | 0.36 | 2010 |
| Thread Merging Schemes for Multithreaded Clustered VLIW Processors | 0 | 0.34 | 2009 |
| Hybrid multithreading for VLIW processors | 2 | 0.40 | 2009 |
| Cluster-Level Simultaneous Multithreading For Vliw Processors | 4 | 0.42 | 2007 |
| Energy Based Design Space Exploration of Multiprocessor VLIW Architectures | 1 | 0.37 | 2007 |
