Explore >> Select a destination
|
You are here 
|
ravendb.net | ||
| | | | |
0x65.dev
|
|
| | | | | Optimizing memory-usage for approximate nearest neighbor search | |
| | | | |
blog.acolyer.org
|
|
| | | | | HyperLogLog in Practice: Algorithmic Engineering of a State of the Art Cardinality Estimation Algorithm - Heule et al. 2013 Continuing on the theme of approximations from yesterday, today's paper looks at what must be one of the best known approximate data structures after the Bloom Filter, HyperLogLog. It's HyperLogLog with a twist though - a... | |
| | | | |
blog.vespa.ai
|
|
| | | | | From text search and recommendation to ads and online dating, ANN search rarely works in isolation. | |
| | | | |
www.softdevtube.com
|
|
| | | Computers are orders of magnitude faster than when most of us started programming and yet a lot of software runs much slower than it should. Nobody likes progress bars. Slow code provides for a horrible user experience, drains batteries faster, and increases our cloud bill. This session explores some of the reasons why software is | ||
