Raghavan (@raghavan)
  • Stars
    star
    699
  • Global Rank 42,931 (Top 2 %)
  • Followers 29
  • Following 10
  • Registered about 15 years ago
  • Most used languages
    Python
    53.8 %
    TypeScript
    15.4 %
    Java
    15.4 %
    PHP
    7.7 %
    C
    7.7 %
  • Location πŸ‡ΊπŸ‡Έ United States
  • Country Total Rank 12,260
  • Country Ranking
    Python
    2,009

Top repositories

1

PdfGptIndexer

RAG based tool for indexing and searching PDF text data using OpenAI API and FAISS (Facebook AI Similarity Search) index, designed for rapid information retrieval and superior search accuracy.
Python
652
star
2

InstantQnA

Build instant question and answer engine for PDF books using OpenAI Models
Python
25
star
3

Semi-Supervised-Learning

Implementing a semi supervised learning algorithm using SVM as base classifier
Python
10
star
4

Life-Logs

Host Your Own Journaling App with OpenAI RAG Summarizer - Allows you to log daily life events, thoughts, and happenings through a text box on the landing page, store the data in a local SQLite database, and visualize a summary of the past day, month, or year using OpenAI's API for generating summaries and advice
Python
5
star
5

MergeSort

A generic mergesort implementation in Java
Java
1
star
6

BlinkerSearch

Crawler and Search engine(BlinkerSearch)
Python
1
star
7

networking

Implementing networking concepts/protocols
C
1
star
8

ghostreader

Chrome extension to search using GPT3
TypeScript
1
star
9

TweetSentimentalAnalyzer

To analyze the sentiment of tweets(opinion mining) - working with 2012 US Presidential election tweets
PHP
1
star
10

PomoSync-MacOS

MacOS Sync Pomodoro to Airtable
TypeScript
1
star
11

LazyStreamer

Lazy implementation of popNext method in python
Python
1
star
12

apriori

Apriori - Frequent data set mining
Java
1
star
13

Boyer-Moore-Vote-Algorithm-with-Visualization

This introduces the implementation of the Boyer-Moore Majority Vote Algorithm to find the most repeated character in a string. The algorithm is efficient, with a time complexity of O(n). Additionally, the PR includes a visualization of the algorithm using Python's Matplotlib library
Python
1
star