✳flâneur — a map of the web's best reading
LNCS 1879 - K-D Trees Are Better When Cut on the Longest Side
web.cs.ucdavis.edu · saved by 1 readers
N/A
Explore this link on the map →saved by
related reading
- annaabrandenberger.github.io
- Elicit: AI for scientific researchelicit.com
- Elicit: AI for scientific researchelicit.org
- Innovation Prior - reconstructed reasoning tracesbohanlyu.com
- Convex hull, Image processing, Image Classification, Image retrieval, Shape detectiondiva-portal.org
- GitHub - josephg/diamond-types: The world's fastest CRDT. WIP. · GitHubgithub.com
- GitHub - socketteer/loom: Multiversal tree writing interface for human-AI collaboration · GitHubgithub.com
- Ai2 Astaasta.allen.ai
- ML Contestsmlcontests.com
- UNMSun.ms
- GitHub - facebookresearch/faiss: A library for efficient similarity search and clustering of dense vectors. · GitHubgithub.com
- GitHub - Egonex-AI/Understand-Anything: Graphs that teach > graphs that impress. Turn any code into an interactive knowledge graph you can explore, search, and ask questions about. Works with Claude Code, Codex, Cursor, Copilot, Gemini CLI,github.com