Name: Thiago Vieira
Type: User
Company: @google
Bio: Software Engineer @google.
(prev.) MSc student at Universidade Federal de Minas Gerais, worked with Fairness in Machine Learning
Location: Belo Horizonte, Brazil
Blog: http://thiagovas.com
Thiago Vieira's Projects
Trabalho Prático I de AEDS III - 2013
Trabalho prático II de AEDS III - 2013
Trabalho prático III de AEDS III - 2013
Trabalho Prático IV de AEDS III - 2013
Some algorithms and data structures implemented by me. Alguns algoritmos e estruturas de dados que implementei.
Docker container running Apache running on Ubuntu
An implementation of a artificial neural network
Temporal graph store abstraction layer.
This is a simple school assignment. I just have to implement an algorithm to calculate betweenness centrality.
Maratona de programaçao - Thiago Vieira, Lucas Renan, Marcos Paulo
scrapes bitcoin data to json
Algumas coisas que fiz em verilog
Created this repository just to keep the dataset of bs-detector, and to make pair-review possible.
Conversor que pega um autômato finito não-determinístico estendido(AFNE) e transforma em um autômato finito não-determinístico(AFN)
An implementation of the CYK algorithm
This is a school assignment. On this assignment I have to implement a simple filesystem.
A search engine that works over sources selected by the user.
A simple formulation and its implementation to get the best top k documents given a query, considering precision and diversity as variables.
Dot files I use
Implementation of Eller's Algorithm in GO
Some exercises I've done based on the "The GO Programming Language" book
An implementation of the K2 Heuristic for induction of a bayesian network from a database of records.
On this repository I'll keep all the code I did to mess around with haskell. Used "Learn You a Haskell for Great Good" (http://learnyouahaskell.com/) as guide.
Trabalho Prático de Organização de Computadores 1
An implementation of some machine learning methods, such as Bayesian Networks and Random Forests.
MaxCut algorithm, written in Julia.
An implementation ( using cplex ) of the original formulation of Miller-Tucker-Zemlin for the TSP
This is an assignment for the graph theory class. On this repository, I'll keep implementations of algorithms that calculates the Minimum Spanning Tree of a graph.