LIST OF IDEAS & PROJECTS
AI
DATA SCIENCE PROJECTS
CYBER SECURITY
MATHEMATICAL PROJECTS
WEB DEVELOPMENT
SN. | Project title | Solution is available? | Estimated lines of code | Estimated duration/ man hours | Outcome | Evaluation criteria |
1 | Space-Efficient Algorithms for Reachability in Directed Geometric Graphs | Algorithm available | 500-800 | 2 months | program to implement the algorithm | understanding, data structures, complexity, correctness |
2 | Scheduling Appointments Online: The Power Of Deferred Decision-Making | Algorithm available | 500-800 | 2 months | program to implement the algorithm | understanding, data structures, complexity, correctness |
3 | Streaming Robust Submodular Maximization: A Partitioned Thresholding Approach | Algorithm available | 500-800 | 2 months | program to implement the algorithm | understanding, data structures, complexity, correctness |
4 | On Near-Linear-Time Algorithms for Dense Subset Sum | Algorithm available | 500-800 | 2 months | program to implement the algorithm | understanding, data structures, complexity, correctness |
5 | Preconditioning methods based on spanning tree algorithms | Algorithm available | 500-800 | 2 months | program to implement the algorithm | understanding, data structures, complexity, correctness |
6 | An algorithm for the construction of the graphs of organic molecules | Algorithm available | 500-800 | 2 months | program to implement the algorithm | understanding, data structures, complexity, correctness |
7 | Online algorithms for partially ordered sets | Algorithm available | 500-800 | 2 months | program to implement the algorithm | understanding, data structures, complexity, correctness |
8 | Nearly Linear Time Isomorphism Algorithms for Some Nonabelian Group Classes | Algorithm available | 500-800 | 2 months | program to implement the algorithm | understanding, data structures, complexity, correctness |
9 | Efficient Generation and Execution of DAG-Structured Query Graphs | Algorithm available | 500-800 | 2 months | program to implement the algorithm | understanding, data structures, complexity, correctness |
10 | Approximation algorithms for NP-complete problems on planar graphs | Algorithm available | 500-800 | 2 months | program to implement the algorithm | understanding, data structures, complexity, correctness |
11 | Graph Sandwich Problems | Algorithm available | 500-800 | 2 months | program to implement the algorithm | understanding, data structures, complexity, correctness |
12 | Efficient DNA sticker algorithms for NP-complete graph problems | Algorithm available | 500-800 | 2 months | program to implement the algorithm | understanding, data structures, complexity, correctness |
13 | Linear time algorithms for NP-hard problems restricted to partial k-trees | Algorithm available | 500-800 | 2 months | program to implement the algorithm | understanding, data structures, complexity, correctness |
14 | The Graph Genus Problem Is NP-Complete | Algorithm available | 500-800 | 2 months | program to implement the algorithm | understanding, data structures, complexity, correctness |
15 | Coping with the NP-Hardness of the Graph Bandwidth Problem | Algorithm available | 500-800 | 2 months | program to implement the algorithm | understanding, data structures, complexity, correctness |
16 | GROUP, GRAPHS, ALGORITHMS: THE GRAPH ISOMORPHISM PROBLEM | Algorithm available | 500-800 | 2 months | program to implement the algorithm | understanding, data structures, complexity, correctness |
17 | Approximation algorithms for the maximally balanced connected graph tripartition problem | Algorithm available | 500-800 | 2 months | program to implement the algorithm | understanding, data structures, complexity, correctness |
18 | Efficient algorithms for clique problems | Algorithm available | 500-800 | 2 months | program to implement the algorithm | understanding, data structures, complexity, correctness |
19 | Efficient algorithms for finding minimum spanning trees in undirected and directed graphs | Algorithm available | 500-800 | 2 months | program to implement the algorithm | understanding, data structures, complexity, correctness |
20 | Efficient algorithms for finding maximum matchings in convex bipartite graphs and related problems | Algorithm available | 500-800 | 2 months | program to implement the algorithm | understanding, data structures, complexity, correctness |
21 | Efficient Algorithms for Petersen's Matching Theorem | Algorithm available | 500-800 | 2 months | program to implement the algorithm | understanding, data structures, complexity, correctness |
22 | Efficient Algorithms for Densest Subgraph Discovery on Large Directed Graphs | Algorithm available | 500-800 | 2 months | program to implement the algorithm | understanding, data structures, complexity, correctness |
SN. | Project title |
1 | Optimal Path for Robot movement using PSO (: https://www.kaggle.com/c/summerschool2020) |
2 | Travelling Sellsman optimization problem Using ACO(https://www.kaggle.com/jamesmcguigan/kmeans-ant-colony-optimization/data) |
3 | Travelling Sellsman optimization problem Using Simulated Annealing(https://www.kaggle.com/jamesmcguigan/kmeans-ant-colony optimization/data) |
4 | Titanic Resque operation Using GA (https://www.kaggle.com/c/titanic/data) |
5 | Optiver Realized Volatility Prediction (https://www.kaggle.com/c/optiver-realized-volatility-prediction/overview/description) |
6 | Connect X: Connect your checkers in a row before your opponent! (https://www.kaggle.com/c/connectx) |
7 | UPI Payment Apps review - Google Play Store (https://www.kaggle.com/komalkhetlani/upi-payment-apps-review-google-play-store) |
8 | Tracking the progression of the new omicron COVID-19 variant (https://www.kaggle.com/yamqwe/omicron-covid19-variant-daily-cases) |
9 | CoronaHack -Chest X-Ray-Dataset (https://www.kaggle.com/praveengovi/coronahack-chest-xraydataset) |
10 | Pulmonary Chest X-Ray Abnormalities (https://www.kaggle.com/kmader/pulmonary-chest-xray-abnormalities). |
11 | Stochastic Programming Model for Bidding Price Decision in Construction Projects |
12 | A stochastic programming approach for clinical trial planning in new drug development |
13 | A multi-objective stochastic programming model for project-oriented human-resource management optimization |
14 | A stochastic programming model for scheduling call centers with global service level agreements. |
15 | Second order cone programming relaxation of nonconvex quadratic optimization problems |
16 | Projection methods for conic feasibility problems: applications to polynomial sum-of-squares decompositions |
17 | Conic relaxations for transmission system planning |
18 | Semidefinite programming relaxations for the graph partitioning problem |
19 | Camera calibration using spheres: A semi-definite programming approach |
20 | High-performance general solver for extremely large-scale semidefinite programming problems |
21 | The use of geometric programming in the design of an Algerian water conveyance system |
22 | Digital circuit optimization via geometric programming |
23 | Ealuation of irrigation projects under uncertainty: a symmetric quadratic programming approach |
24 | A neural network model for solving convex quadratic programming problems with some applications |
25 | Efficient subspace segmentation via quadratic programming |
26 | OSQP: An operator splitting solver for quadratic programs |
27 | Resources Allocation in Activity Networks Under Stochastic Conditions: A Geometric Programming-Sample Path Optimization Approach |
28 | Application of the honeybee mating optimization algorithm to patent document classification in combination with the support vector machine |