Lists (1)
Starred repositories
I share with you a range of quantum physics papers i've accumulated during years. Maybe it will be useful for you.
1
Updated Apr 23, 2018
A deep learning approach, using Python and YOLOv3, to identify electronic components in computer’s PSUs (Power Supply Units).
this code shows the train and test of a YOLOV5 convolutional neural network for detection of electronics components
I share with you a range of quantum physics papers i've accumulated during years. Maybe it will be useful for you.
Old resources in Physics and Chemistry
OCR on unsearchable and large PDF file
A Cloudflare Worker script that mirrors Docker Hub
Validate and transform various OCR file formats (hOCR, ALTO, PAGE, FineReader)
User contributed (non Google) OCR models for Tesseract
ArdeshirV / fasthttp
Forked from valyala/fasthttpFast HTTP package for Go. Tuned for high performance. Zero memory allocations in hot paths. Up to 10x faster than net/http
ArdeshirV / alacritty
Forked from alacritty/alacrittyA cross-platform, OpenGL terminal emulator.
Melanee-Melanee / tessdata
Forked from tesseract-ocr/tessdataTrained models with fast variant of the "best" LSTM models + legacy models
3
Updated Oct 4, 2024
Trained models with fast variant of the "best" LSTM models + legacy models
A simple code to empower recruiters to swiftly identify top talent based on their custom keywords
دورهی خلاقیت الگوریتمی و برنامهنویسی پایتون، برای دانشآموزان دبیرستان
Machine Learning Course, Sharif University of Technology
LinkedIn AutoClicker
This project is a web application that generates random arrays using NumPy and sends them to connected clients in real-time using Flask and Flask-SocketIO.
yasamin-khodarahmi / Old-Persian-Dataset
Forked from Electronic-Old-Persian-Library/Old-Persian-DatasetRaw dataset for Old Persian cuneiform
Raw dataset for Old Persian cuneiform
Melanee-Melanee / most-repeated-vocabulary-IELTS
Forked from fatemeh-mohseni-AI/most-repeated-vocabulary-IELTSThis project is a FastAPI-based web application designed to analyze C a m b r i d g e I E L T S P D F s ( B o o k s 1 − 18 ) for the most and least repeated words. It can handle both regular text-b…