Category Computer Science
The densest subgraph problem with negative weights
Few days ago I uploaded on Arxiv our preprint “Novel Dense Subgraph Discovery Primitives: Risk Aversion and Exclusion Queries”. This is joint work with Tianyi, Nao, and Jakub. In this paper we study the following extension of the densest subgraph problem (DSP) that is known to be solvable exactly in polynomial time on graphs with […]
Denoising binary images
Let’s start by writing the letter T using numpy in Python, encoded in a 0/1 array. Let’s visualize this. This is what we get, indeed the array represents the letter “T”. Now, let’s generate a corrupted version of this image by flipping each bit with some probability p. We can also do it a bit faster […]
Graph mining with a faulty oracle
Pythia was a powerful and respected woman in Ancient Greece. She was the high priestess of the Temple of Apollo at Delphi. I was surprised to read in the Wikipedia article that the name Pythia is derived from the verb πύθειν (púthein) which means “to rot”; I find this to be unlikely. An etymology that sounds […]
tsourakakis.com 