Pinned Repositories
-M2R-ParallelQuicksort
Computer-vision-labs
Mini-projects of computer vision
ddd20-utils
DDD20 End-to-End Event Camera Driving Dataset
Healthapp
Mettre en relation les parents pour récupérer leurs enfants
MOSIG-SMPE-2021
Repository containing notes, my homework and computational documents of "Scientific Methodology and (emPirical|exPerimental) Evaluation" lecture presented in MoSIG.
Reinforcement-learning-Labs
Siqleton
Development of a game consisting of randomly scrolling four kind of arrows and the user had to click to the right arrows using the keyboard before they reach the end of the screen. The scrolling speed increases according to the level.
Trabajos
Une plateforme de résolution du problème de flowshop de pemutation FSP - A platform for solving flowshop scheduling problem with exact methods, heuristics (NEH, Palmer, Johnson, CDs) and metaheuristics (Genetic Algorithm, Simulated Annealing, Tabu Search).
Joint-A-SNN
Joint A-SNN: Joint Training of Artificial and Spiking Neural Networks via Self-Distillation and Weight Factorization
EventSAM
Code for CVPR'24 Paper: Segment Any Event Streams via Weighted Adaptation of Pivotal Tokens
AiladReb's Repositories
AiladReb/-M2R-ParallelQuicksort
AiladReb/Computer-vision-labs
Mini-projects of computer vision
AiladReb/ddd20-utils
DDD20 End-to-End Event Camera Driving Dataset
AiladReb/Healthapp
Mettre en relation les parents pour récupérer leurs enfants
AiladReb/MOSIG-SMPE-2021
Repository containing notes, my homework and computational documents of "Scientific Methodology and (emPirical|exPerimental) Evaluation" lecture presented in MoSIG.
AiladReb/Reinforcement-learning-Labs
AiladReb/Siqleton
Development of a game consisting of randomly scrolling four kind of arrows and the user had to click to the right arrows using the keyboard before they reach the end of the screen. The scrolling speed increases according to the level.
AiladReb/Trabajos
Une plateforme de résolution du problème de flowshop de pemutation FSP - A platform for solving flowshop scheduling problem with exact methods, heuristics (NEH, Palmer, Johnson, CDs) and metaheuristics (Genetic Algorithm, Simulated Annealing, Tabu Search).