/explore
|
You are here 
|
www.adamconrad.dev | ||
| | | | |
matbesancon.xyz
|
|
| | | | | In various graph-related algorithms, a graph is modified through successive operations, merging, creating and deleting vertices. That's the case for the Blossom algorithm finding a best matching in a graph and using contractions of nodes. | |
| | | | |
opensourc.es
|
|
| | | | | An introduction to the most simple TSP heuristic as well as a more sophisticated lower bound. More coming soon! | |
| | | | |
spin0r.wordpress.com
|
|
| | | | | Every serious competitive programmer knows how to find all bridges and articulation points in an undirected graph in linear time. Recently, however, I came across a problem that required finding the biconnected components explicitly, and I couldn't figure out how to do it. The usual suspects, surprisingly, don't explain it. Sedgewick's Algorithms, 3rded., PartV discusses... | |
| | | | |
erikbern.com
|
|
| | | I've been spending quite some time lately playing around with RNN's for collaborative filtering. RNN's are models that predict a sequence of something. The beauty is that this something can be anything really - as long as you can design an output gate with a proper loss function, you can model essentially anything. | ||
