Search Results for "240p-test-suite"

DomainBed is a PyTorch-based research suite created by Facebook Research for benchmarking and evaluating domain generalization algorithms. It provides a unified framework for comparing methods that aim to train models capable of performing well across unseen domains, as introduced in the paper In Search of Lost Domain Generalization. The library includes a wide range of well-known domain generalization algorithms, from classical baselines such as Empirical Risk Minimization (ERM) and Invariant Risk Minimization (IRM) to more advanced techniques like Domain Adversarial Neural Networks (DANN), Adaptive Risk Minimization (ARM), and Invariance Principle Meets Information Bottleneck (IB-ERM/IB-IRM). ...

The Pythonic Data Structures and Algorithms repository by keon is a hands-on collection of implementations of classical data structures and algorithms written in Python. It offers working, often well-commented code for many standard algorithmic problems — from sorting/searching to graph algorithms, dynamic programming, data structures, and more — making it a valuable resource for learning and reference. For students preparing for technical interviews, self-learners brushing up on...

...The gym library is a collection of test problems — environments — that you can use to work out your reinforcement learning algorithms. These environments have a shared interface, allowing you to write general algorithms.

Binarytree is Python library that lets you generate, visualize, inspect and manipulate binary trees. Skip the tedious work of setting up test data, and dive straight into practicing algorithms. Heaps and BSTs (binary search trees) are also supported. Binarytree supports another representation which is more compact but without the indexing properties. Traverse trees using different algorithms.

Consistent Depth is a research project developed by Facebook Research that presents an algorithm for reconstructing dense and geometrically consistent depth information for all pixels in a monocular video. The system builds upon traditional structure-from-motion (SfM) techniques to provide geometric constraints while integrating a convolutional neural network trained for single-image depth estimation. During inference, the model fine-tunes itself to align with the geometric constraints of a...

Interactive Coding Challenges is a collection of practice problems designed to strengthen data structures, algorithms, and problem-solving skills. The repository emphasizes a learn-by-doing approach: you read a prompt, attempt a solution, and verify behavior with tests, often within notebooks or scripts. Problems span arrays, strings, stacks, queues, linked lists, trees, graphs, dynamic programming, and more, mirroring common interview themes. Many challenges include hints and reference...

Charting tools, backtesting tools, and data visualization tools for the most popular cryptocurrencies.

...The repository is particularly useful for people preparing for competitive programming, job interviews, or building a foundational understanding of algorithmic patterns. Because it’s openly maintained, you can browse through issues, see test cases, and observe coding style in a “learning through code” fashion. It also serves as a playground where you can add problems, measure performance, and compare different algorithmic approaches. For anyone striving to move from “I know the syntax” to “I know how to use the right algorithm at the right time,” this repository is a practical asset.

Open Metaheuristic (oMetah) is a library aimed at the conception and the rigourous testing of metaheuristics (i.e. genetic algorithms, simulated annealing, ...). The code design is separated in components : algorithms, problems and a test report generator