Parameterless (Almost) Clustering Algorithm Input is a single CSV file and the output will be a file named 'output.csv' which has the full original data + an extra 'label' column that specifies what ...

Abstract: In order to overcome the shortcoming of the classical Hungarian algorithm that it can only solve the problems where the total cost is the sum of that of each job, an improved Hungarian ...

Centre for Social Sciences, Institute for Political Science, Hungarian Academy of Sciences; Corvinus University of Budapest, Institute of International Studies; Cold War History Research Center, ...

The 1956 Hungarian uprising and the subsequent installation of a pro-Soviet government in Budapest pushed hundreds of thousands of refugees into neighboring countries. The refugee crisis created new ...

Finding bipartite matchings is one of the oldest and most well-studied problems in computer science. This problem comes up in many guises, such as when matching donors to recipients for organ ...

Interesting and effective team behaviors arise when a group of agents contend with adversaries. Examples range from animal group behaviors observed in nature to strategies used in team sports. This ...

This is the code used for unsupervised training of convolutional neural networks as described in the ICML 2017 paper Unsupervised Learning by Predicting Noise (arXiv). The code is composed of two ...