Compute Euclidean and spherical distances. VERY FAST. TINY.
-
Updated
Sep 18, 2017 - JavaScript
Compute Euclidean and spherical distances. VERY FAST. TINY.
Lab "Efficient Algorithms for Selected Problems" in summer term 2016 for University of Bonn
Crowd-Optimized R Functions
Implemented a project for designing the use of resolution in full first order logic. The project has been implemented in Java and an efficient algorithm has been used for parsing the data and for unification.
Efficient Approach to Dependency Injection with Dagger2 Android
Concurrent implementation of Aho-Corasick string matching algorithm in C.
PeleeNet: An efficient DenseNet architecture for mobile devices
An Implementation of WUFPC algorithm and its application in percolation threshold problem in C++ language.
Code for "Linear Time Complexity Time Series Classification with Bag-of-Pattern-Features"
Code for "Linear Time Motif Discovery in Time Series"
Coursera's Data Structures and Algorithms Specialization
Algorithms and data structures project for the course "Algoritmi e principi per l'informatica" of Politecnico di Milano, a.y. 2018/2019
A modification of the conventional Round-Robin Algorithm along with implementation in C
Code of our winning entry to NTIRE super-resolution challenge, CVPR 2018
Programming challenges repository
This is our implementation of EATNN: Efficient Adaptive Transfer Neural Network (SIGIR 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 JNSKR: Jointly Non-Sampling Learning for Knowledge Graph Enhanced Recommendation (SIGIR 2020)
Standard algorithms for competitive programming in C++, with explanations.
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."