Pinned Repositories
Bag-of-words-model-using-NN
CCAs-HEAs-calculator
This code calculates some CCAs/HEAs parameters.
ChatBot_Project
competitive_programming
covers almost all important sections fields of competative programming.
cops_namecards
COPS Repository for Contributors Namecards
Digit-Recognizer
hello-cops
Print "Hello COPS" in different programming languages
k17dqca347
Consider a scheduling approach which is non pre-emptive similar to shortest job next in nature. The priority of each job is dependent on its estimated run time, and also the amount of time it has spent waiting. Jobs gain higher priority the longer they wait, which prevents indefinite postponement. The jobs that have spent a long time waiting compete against those estimated to have short run times. The priority can be computed as : Priority = 1+ Waiting time / Estimated run time Write a program to implement such an algorithm.
learn-python3-thw-code
The code to Learn Python3 The Hard Way
learn.jquery.com
jQuery Learning Center web site content
Riya-V's Repositories
Riya-V/Traffic-sign-detection-using-CNN-keras
Riya-V/CCAs-HEAs-calculator
This code calculates some CCAs/HEAs parameters.
Riya-V/new
Riya-V/Risk_dashboard_insurance
A dashboard which helps insurance companies to analyze customers risk
Riya-V/workshop
Codes shown in the workshop
Riya-V/ChatBot_Project
Riya-V/Bag-of-words-model-using-NN
Riya-V/Digit-Recognizer
Riya-V/hello-cops
Print "Hello COPS" in different programming languages
Riya-V/cops_namecards
COPS Repository for Contributors Namecards
Riya-V/WebLoader
Nette Framework addon for CSS and JS files loading
Riya-V/WebEssentials2015
A Visual Studio extension for web developers
Riya-V/WebApiHMACAuthentication
Project shows how to implement HMAC Authentication is ASP.NET Web API 2
Riya-V/k17dqca347
Consider a scheduling approach which is non pre-emptive similar to shortest job next in nature. The priority of each job is dependent on its estimated run time, and also the amount of time it has spent waiting. Jobs gain higher priority the longer they wait, which prevents indefinite postponement. The jobs that have spent a long time waiting compete against those estimated to have short run times. The priority can be computed as : Priority = 1+ Waiting time / Estimated run time Write a program to implement such an algorithm.
Riya-V/pull_facebook_data_for_good
Imitate an API for downloading data from Facebook Data For Good
Riya-V/SlicerGitSVNArchive
Multi-platform, free open source software for visualization and image computing.
Riya-V/learn.jquery.com
jQuery Learning Center web site content
Riya-V/SunknightsWebsite
Riya-V/competitive_programming
covers almost all important sections fields of competative programming.
Riya-V/learn-python3-thw-code
The code to Learn Python3 The Hard Way