(CVPR2024 Highlight) Novel Class Discovery for Ultra-Fine-Grained Visual Categorization (UFG-NCD)
-
Updated
Jul 1, 2024 - Python
(CVPR2024 Highlight) Novel Class Discovery for Ultra-Fine-Grained Visual Categorization (UFG-NCD)
Pure-Python extended Euclidean algorithm implementation that accepts any number of integer arguments.
University project: glow curve analysis software for exponential heating
Cryptography course - Cryptography modules - classic chipers - DES function f - Number theory module
Computing the greatest common divisor (GCD) of two numbers
Compute the least common multiple (lcm).
Greatest Common Divisor Calculator
Proste programy napisane w 🐍PYTHONIE🐍
A simple Docker environment for the Grand Comic Database (GCD) with some Python scripts for interacting with the database
Python Try
Compute the least common multiple (lcm) of two single-precision floating-point numbers.
Решено 36 алгоритмических задач различной сложности на языке Python. Оформлен файл Readme.md с описанием каждой задачи и ссылками на исходный код с решениями.
Extended GCD algorithm in Python and Rust
Solution to HackerRank "between-two-sets" problem in Algorithms/Implementation section
Standard GCD algorithm in Python and Rust
This is a very simple python script that helped me find the Greatest Common Divisor of two numbers using the Euclidean Algorithm (with steps!)
Add a description, image, and links to the gcd topic page so that developers can more easily learn about it.
To associate your repository with the gcd topic, visit your repo's landing page and select "manage topics."