Events Archive

Find an Event

Oct
19

Time

to

Locations

E1 119

Locations

Description One of the most characteristic features of a graph corresponding to many self-organizing networks is its degree sequence, in which the fraction of vertices of degree larger than k...

Oct
5

Time

to

Locations

LS 152

Locations

Description Due to current data collection technology, our ability to gather data has surpassed our ability to analyze it. In particular, k-means, one of the simplest and fastest clustering algorithms...

Oct
3

Time

to

Locations

E1 106

Locations

Event Topic: Computational Mathematics & Statistics

Sep
29

Time

to

Locations

E1 TBA

Locations

Description This presentation starts off with a short introduction of the puzzle itself, giving a few words about human-like solutions, and giving a few words about how easy it is to implement those...