soumyaiitkgp Goto Github PK

a2oj-

Solution for ladders

aima-python

Python implementation of algorithms from Russell And Norvig's "Artificial Intelligence - A Modern Approach"

awesome-autonomous-vehicles

Curated List of Self-Driving Cars and Autonomous Vehicles Resources

awesome-robotics

A list of awesome Robotics resources

custom_mask_rcnn

Custom Mask R-CNN for object detection and instance segmentation on Keras and TensorFlow

custom_maskrcnn

Custom Mask R-CNN for object detection and instance segmentation on Keras and TensorFlow

fmin_adam

Matlab implementation of the Adam stochastic gradient descent optimisation algorithm

freemium

Program to view unlimited amount of OTT platform services based on automatic cookie deletion

hackerrank-solution

Hackerrank solutions for python

hello-world

for coding

learning-deep-learning

Paper reading notes on Deep Learning and Machine Learning

learnopencv

Learn OpenCV : C++ and Python Examples

list_of_recommender_systems

A List of Recommender Systems and Resources

modelserver

(Author - Sahil, Contributor- Soumya) Basic ML Model Server (Model as API) in Django

mytest

opencv

Open Source Computer Vision Library

opensource.guide

📚 Community guides for open source creators

prediction-and-modelling-of-wave-height

recommendation_system

silver-garbanzo

singel-view-meterology-depth_estimation

This is my approach to estimate height/depth of world coordinates with respect to the camera coordinates without the knowledge of intrinsic parameters. Mapping 3-D coordinates to the 2-D coordinates on the image plane.

spoon-knife

This repo is for demonstration purposes only.

stick-problem

Scenario: You've got N sticks aligned parallel to each other. Each stick consits of two end points, top and bottom. Both end points are labelled with two numbers a[i] and b[i]. The number ranges from 1 to 9. you have to sum the numbers for each of the end point along all the stick. Problem: Lets call these sums s1 and s2. Now the goal is to have both these sums s1 and s2 to be an even number. Inorder to achieve that you can rotate any stick upside down, effectively swapping endpoints of any stick. Given the number of sticks and numbers labelled at each of its end point, find the minimum number of swaps required to achieve our goal. Input: First line is the number of sticks, followed by endpoints of each stick. Output: A single line containing number of minimum swaps required. If no swaps are required or possible, output -1.

sustech_sense

Web developement for SUSTech IoT project

tensorflow-object-detection-api-tutorial-train-multiple-objects-windows-10

How to train a TensorFlow Object Detection Classifier for multiple object detection on Windows

text-analytics-msba

This repo contains projects from my Text Analytics Coursework. I took this course in Fall 2018 at UT Austin

time_series-analysis-

A project on forecasting of wave height

yolo_object_detection

This is the code for "YOLO Object Detection" by Siraj Raval on Youtube