Discover raghavan/Boyer-Moore-Vote-Algorithm-with-Visualization Open

Stars
1
Language
Python
Created 6 months ago
Updated 6 months ago

raghavan

There are no reviews yet. Be the first to send feedback to the community and the maintainers!

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

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

InstantQnA

Build instant question and answer engine for PDF books using OpenAI Models

Python

Semi-Supervised-Learning

Implementing a semi supervised learning algorithm using SVM as base classifier

Python

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