Elia Innocenti's repositories
TuringMachines
Exercise for Theory of Computation Exam @ Unifi - Turing Machines Simulator.
ArduinoDetector
Project for Industrial Computing @ Unifi - Arduino Detector for a simple embedded system, programmed in a host-target environment.
SimulatedAnnealing_TSP
Project for Artificial Intelligence Exam @ Unifi - Simulated Annealing Algorithm implementation and application to the Travelling Salesman Problem.
SISOP_esercizi
Exercises for Operating Systems Exam @ Unifi - Concurrent access to data, threads, synchronisation with semaphores and synchronised methods.
AStarSearch
Project for Programming Laboratory @ Unifi - A* Algorithm in a grid (SFML graphics).
Florence1k
Support project for my Bachelor's thesis @ Unifi - Florence1k, a novel dataset for monument recognition in Florence, Italy. The dataset is designed for both object detection and image retrieval tasks, featuring: XML annotations in PASCAL VOC format, JSON annotations in COCO format, a .pkl file for image retrieval.
nvim-config
Nvim configuration files
Oxford5k-Paris6k-ObjectDetection
Support project for my Bachelor's thesis @ Unifi - Converting Oxford5k and Paris6k into datasets suitable for object detection tasks. This repository contains scripts to create XML (PASCAL VOC format) and JSON (COCO format) annotations from .pkl files, enabling the training of an SSD/MobileNet object detection model.
ReInHerit-SmartTourism
Main project for my Bachelor's Thesis @ Unifi - SmartTourism: an android app for monument recognition (object detection version).
RendezVous
Project for Software Engineering Exam @ Unifi - Event creation and participation software.
eliainnocenti
All about me
eliainnocenti.github.io
Personal Website
InsertionSort_BubbleSort
Project for Algorithms and Data Structures Laboratory @ Unifi - Notebook to show the differences in time complexity and efficiency between Insertion Sort and Bubble Sort.
StringMatchingAlgorithms
Project for Algorithms and Data Structures Laboratory @ Unifi - Python functions and LaTeX relation to analyze String Matching Algorythms.