TRIM: Accelerating High-Dimensional Vector Similarity Search with Enhanced Triangle-Inequality-Based Pruning
arxiv.org·5h
🗂️Vector Databases
Bmssp: A New Shortest Path Algorithm
rohanparanjpe.substack.com·14h·
Discuss: Substack
🔗Topological Sorting
Why Semantic Layers Matter—and How to Build One with DuckDB
ssp.sh·2d
🗄️Database Internals
k-NN Classification and Model Evaluation
dev.to·1h·
Discuss: DEV
🧠Machine Learning
Elasticsearch Explained with Real-Life Example: Why It Beats SQL for Search
blog.devops.dev·19h
🚀Query Optimization
Enclosures that minimize the sum of area and perimeter
11011110.github.io·15h
📊Computational Geometry
Improving Search for Deep Research Agents
vishnudut.com·11h·
Discuss: Hacker News
🧠Query Planners
Sets & Heaps in Haskell and Rust
mmhaskell.com·1d
🔒Type Safety
STRelay: A Universal Spatio-Temporal Relaying Framework for Location Prediction with Future Spatiotemporal Contexts
arxiv.org·5h
🔶Voronoi Diagrams
Show HN: DataCompose – Prevent downstream data failures with composite functions
datacompose.io·13h·
Discuss: Hacker News
✅Format Validation
Learning ON Large Datasets Using Bit-String Trees
arxiv.org·5h
🗂️Vector Databases
Logistic vs SVM vs Random Forest: Which One Wins for Small Datasets?
machinelearningmastery.com·19h
🧠Machine Learning
Speedrunning the New York Subway
blog.trailofbits.com·22h
🔃Feed Algorithms
Effective Clustering for Large Multi-Relational Graphs
arxiv.org·5h
🌊Spectral Clustering
How Retrieval Algorithms Shape Better LLM Responses?
dev.to·8h·
Discuss: DEV
🔍Information Retrieval
Powerful GPUs or Fast Interconnects: Analyzing Relational Workloads
vldb.org·11h·
Discuss: Hacker News
📊Performance Profiling
How to Benchmark Classical Machine Learning Workloads on Google Cloud
towardsdatascience.com·12h
⚡Performance Mythology
Distributed Request Assignment with Max‑Min and Deviation Fairness in On‑Demand Mobility
hackernoon.com·11h
📡Network Calculus
How I Approach Performance Investigations – By Rico Mariani
ricomariani.medium.com·1d·
Discuss: Hacker News
🎯Performance Forensics
Accelerating Historical K-Core Search in Temporal Graphs
arxiv.org·5h
🕸️Neo4j