Code of our winning entry to NTIRE super-resolution challenge, CVPR 2018
-
Updated
Apr 27, 2020 - Python
Code of our winning entry to NTIRE super-resolution challenge, CVPR 2018
Computationally efficient rolling window iterators for Python (sum, variance, min/max, etc.)
Official code for our ECCV'22 paper "A Fast Knowledge Distillation Framework for Visual Recognition"
PeleeNet: An efficient DenseNet architecture for mobile devices
This is our implementation of ENMF: Efficient Neural Matrix Factorization (TOIS. 38, 2020). This also provides a fair evaluation of existing state-of-the-art recommendation models.
Coursera's Data Structures and Algorithms Specialization
Spatially and Temporally Efficient Non-local Attention Network for Video-based Person Re-Identification (BMVC 2019)
This is our implementation of EHCF: Efficient Heterogeneous Collaborative Filtering (AAAI 2020)
This is our implementation of ENSFM: Efficient Non-Sampling Factorization Machines (WWW 2020)
This is our implementation of EATNN: Efficient Adaptive Transfer Neural Network (SIGIR 2019)
This is our implementation of JNSKR: Jointly Non-Sampling Learning for Knowledge Graph Enhanced Recommendation (SIGIR 2020)
Video-based Person Re-identification without Bells and Whistles (CVPRw 2021)
[TIP] APP-Net: Auxiliary-point-based Push and Pull Operations for Efficient Point Cloud Recognition
Efficient Carpool route algorithm
(WIP) Application of randomized HE regression to efficiently fit multiple kernels to biobank data. This work aims to separate the linear effects from higher order interactions between SNPs.
an efficient algorithm for finding the shortest path from a source node to a destination node in a graph, with a visual representation
This repo contains all the scripts that I wrote while working for various organisations as well as while contributing to open source projects
"Code from Hands-On Simulation Modeling with Python - Second Edition by Packt, focusing on simulation models for efficient decision-making."
Brute Force to find the minimum distance between 2 points in a set of n points takes (n^2) computations. Can we do better?
Add a description, image, and links to the efficient-algorithm topic page so that developers can more easily learn about it.
To associate your repository with the efficient-algorithm topic, visit your repo's landing page and select "manage topics."