Explore >> Select a destination
|
You are here 
|
www.kuniga.me | ||
| | | | |
nickhar.wordpress.com
|
|
| | | | | The algorithm for probabilistically embedding metric spaces into trees has numerous theoretical applications. It is a key tool in the design of many approximation algorithms and online algorithms. Today we will illustrate the usefulness of these trees in designing an algorithm for the online Steiner tree problem. 1. Online Steiner Tree Let $latex {G=(V,E)}&fg=000000$ be... | |
| | | | |
jessegalef.com
|
|
| | | | | You might know all about the 'Birthday Paradox', but I bet you can't solve this mathy variant. Birthdays, Bridges of Konigsberg, de Bruijn Graphs, and... Bgenomics. | |
| | | | |
lh3.github.io
|
|
| | | | | [AI summary] The article discusses the properties and implementation of De Bruijn graphs in DNA sequencing assembly, highlighting their subgraph structures and how they differ from the mathematical definition. | |
| | | | |
alain.xyz
|
|
| | | An overview of various ray operations, their similarities, differences, and how to implement each type of ray operation in real time rendering. | ||
