Explore >> Select a destination
|
You are here 
|
www.jeremykun.com | ||
| | | | |
blog.nelhage.com
|
|
| | | | | How do you find near-duplicates in a massive collection of documents? An exploration of the Jaccard similarity metric, and the MinHash hashing trick used to efficiently approximate it at web scale. | |
| | | | |
ianwrightsite.wordpress.com
|
|
| | | | | Riemann's Zeta function is an infinite sublation of Hegelian integers. | |
| | | | |
martinfowler.com
|
|
| | | | | Security is both very important and often under-emphasized. While many targeted techniques help, there are some basic clean code habits which every developer can and should be doing | |
| | | | |
djalil.chafai.net
|
|
| | | This post is devoted to few convex and compact sets of matrices that I like. The set \( {\mathcal{C}_n} \) of correlation matrices. A real \( {n\times n} \) matrix \( {C} \) is a correlation matrix when \( {C} \) is symmetric, semidefinite positive, with unit diagonal. This means that \[ C_{ii}=1, \quad C_{ji}=C_{ji},\quad \left\geq0 \] for every \(... | ||
