Brute Force to find the minimum distance between 2 points in a set of n points takes (n^2) computations. Can we do better?
-
Updated
Jan 31, 2021 - Python
Brute Force to find the minimum distance between 2 points in a set of n points takes (n^2) computations. Can we do better?
Coding Problems taken from websites like leetcode, hackerrank, codeforces, etc. and my solutions usually in Python
Repository in which I store my ways of solving riddles in Python.
This repo contains all the scripts that I wrote while working for various organisations as well as while contributing to open source projects
Efficient Carpool route algorithm
an efficient algorithm for finding the shortest path from a source node to a destination node in a graph, with a visual representation
[TIP] APP-Net: Auxiliary-point-based Push and Pull Operations for Efficient Point Cloud Recognition
Video-based Person Re-identification without Bells and Whistles (CVPRw 2021)
This is our implementation of JNSKR: Jointly Non-Sampling Learning for Knowledge Graph Enhanced Recommendation (SIGIR 2020)
This is our implementation of EATNN: Efficient Adaptive Transfer Neural Network (SIGIR 2019)
This is our implementation of ENSFM: Efficient Non-Sampling Factorization Machines (WWW 2020)
This is our implementation of EHCF: Efficient Heterogeneous Collaborative Filtering (AAAI 2020)
Spatially and Temporally Efficient Non-local Attention Network for Video-based Person Re-Identification (BMVC 2019)
Coursera's Data Structures and Algorithms Specialization
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.
PeleeNet: An efficient DenseNet architecture for mobile devices
Official code for our ECCV'22 paper "A Fast Knowledge Distillation Framework for Visual Recognition"
Computationally efficient rolling window iterators for Python
Code of our winning entry to NTIRE super-resolution challenge, CVPR 2018
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."