Pinned Repositories
MYteor
Projeto aprendizado Meteor
csr-formatter
C++ package to store Matrix Market (.mtx) file format sparse matrices in Compressed Row Storage (CSR) format.
glpiAlertsChromeExtension
Chrome extension that pops up a Chrome Alert whenever a new ticket arrives in your GLPI database.
Meteor-Files
🚀 Upload files via DDP or HTTP to ☄️ Meteor server FS, AWS, GridFS, DropBox or Google Drive. Fast, secure and robust.
nonlinear_algorithms
Implementation of some classical nonlinear optimization algorithms
python_k-means
Simple k-means clustering algorithm python implementation for educational purposes.
python_max_heap
Python implementation of a Max Heap based on Cormen's 'Introduction to Algorithms' book for educational purposes.
python_recursive_binary_tree
Simple recursive binary tree implementation in Python for educational purposes.
tsp-solver
Contact page that allows you to generate a random Travelling Salesman Problem (TSP) instance and solve it with 3 different solution methods.
MeteorReactBaseMUI
Meteor + React + Material-UI
notini's Repositories
notini/csr-formatter
C++ package to store Matrix Market (.mtx) file format sparse matrices in Compressed Row Storage (CSR) format.
notini/glpiAlertsChromeExtension
Chrome extension that pops up a Chrome Alert whenever a new ticket arrives in your GLPI database.
notini/Meteor-Files
🚀 Upload files via DDP or HTTP to ☄️ Meteor server FS, AWS, GridFS, DropBox or Google Drive. Fast, secure and robust.
notini/nonlinear_algorithms
Implementation of some classical nonlinear optimization algorithms
notini/python_k-means
Simple k-means clustering algorithm python implementation for educational purposes.
notini/python_max_heap
Python implementation of a Max Heap based on Cormen's 'Introduction to Algorithms' book for educational purposes.
notini/python_recursive_binary_tree
Simple recursive binary tree implementation in Python for educational purposes.
notini/tsp-solver
Contact page that allows you to generate a random Travelling Salesman Problem (TSP) instance and solve it with 3 different solution methods.