/explore
|
You are here 
|
www.kuniga.me | ||
| | | | |
sideways-view.com
|
|
| | | | | Imagine a world where some pairs of whom want to talk to each other---each person has a uniquen-bitidentity (e.g. 64-bit strings), and wants to send a message to someone with a particular identity. The number of people is ballpark exp(n), I'm imagining ~10 billion. We'll start with a graph G, where people know how to... | |
| | | | |
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... | |
| | | | |
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. | |
| | | | |
initialcommit.com
|
|
| | | There are so many programming books out there, sometimes it's hard to know what books are best. You won't find cracking the coding interview, the pragmatic programmer, or even the best python book. These are the best programming books curated from each major Software field. | ||
