Nihal Potdar (NihalPotdar)

NihalPotdar

Geek Repo

Location:San Francisco

Home Page:https://nihalpotdar.com

Twitter:@NihalPotdar

Github PK Tool:Github PK Tool

Nihal Potdar's repositories

AutoAWQ

AutoAWQ implements the AWQ algorithm for 4-bit quantization with a 2x speedup during inference. Documentation:

License:MITStargazers:0Issues:0Issues:0

vllm

A high-throughput and memory-efficient inference and serving engine for LLMs

License:Apache-2.0Stargazers:0Issues:0Issues:0

RecapThisVideo

A NLP-based web application which can summarize any video within 5 lines, saving users the time and convenience of going through the videos themselves.

Language:PythonStargazers:0Issues:0Issues:0
Language:PythonStargazers:0Issues:0Issues:0

ConvertToText

Command line tool/ python library to convert handwritten files directly to an excel file

Language:PythonStargazers:0Issues:0Issues:0

RemindMeWhenReady

A cross-platform mobile app aimed at resolving the mental anxiety coming from excessive technology use, by allowing users to customize the notifications coming from their phone and beyond!

Language:PythonStargazers:0Issues:0Issues:0

ArduinoVoiceRecognitionTool

A voice recognition tool designed to recognize user input based on frequency. The Arduino is attached to a frequency sensor with data that can be analyzed, using integration for the duration and derivatives for the maximum intensity. This combination is then reported on to the serial port, and then read by the Java environment. The data read is then entered into a file, and analyzed. The voice calibration feature allows users to set a range of "loud, medium, and soft" sounds corresponding to their needs - resulting in a better understanding of user requirements and an enhanced ability to tailor to their needs.

Language:JavaStargazers:1Issues:0Issues:0

SudokuSolver

A Java algorithm which implements a backtracking algorithm to find the solution to any sudoku in the world!

Language:JavaStargazers:0Issues:0Issues:0

KnightsTour

The Knight's tour problem is a very complex mathematical problem that explores if a knight beginning in a particular position, can reach every square on a chess board.

Language:JavaStargazers:0Issues:0Issues:0

Mastermind

This algorithm, always solves the mastermind game in 5 attempts or less.

Language:JavaStargazers:0Issues:0Issues:0