๐Ÿฟ๏ธ ScourBrowse
LoginSign Up
You are offline. Trying to reconnect...
Copied to clipboard
Unable to share or copy to clipboard
๐Ÿ” Search Indexing

Inverted Indexes, B+ Trees, Query Optimization, Full-text Search

Brent Yorgey: Competitive programming in Haskell: range queries, classified
byorgey.github.ioยท3d
ฮปLambda Encodings
Diving deep into Binius M3 arithmetization using Merkle tree inclusion as an example
blog.lambdaclass.comยท2d
๐ŸŒณArchive Merkle Trees
Mastering Dijkstra's Algorithm in C++ with CXXGraph
medium.comยท7hยท
Discuss: Hacker News
๐Ÿ“E-graphs
Show HN: Anagnorisis, local data-management with trainable recommendation engine
github.comยท17hยท
Discuss: Hacker News
๐Ÿค–Archive Automation
DRIFT: Data Reduction via Informative Feature Transformation- Generalization Begins Before Deep Learning starts
arxiv.orgยท1d
๐Ÿง Machine Learning
Client Clustering Meets Knowledge Sharing: Enhancing Privacy and Robustness in Personalized Peer-to-Peer Learning
arxiv.orgยท12h
๐Ÿ”’Privacy Preserving
Markov-Enhanced Clustering for Long Document Summarization: Tackling the 'Lost in the Middle' Challenge with Large Language Models
arxiv.orgยท2d
๐Ÿ“„Text Chunking
Why Your Next LLM Might Not Have A Tokenizer
towardsdatascience.comยท1d
๐Ÿค–Grammar Induction
Flame Graph Performance Truth Analysis๏ผˆ1750918443851900๏ผ‰
dev.toยท10hยท
Discuss: DEV
โšกPerformance Tools
A Spatio-Temporal Point Process for Fine-Grained Modeling of Reading Behavior
arxiv.orgยท12h
๐Ÿ“ŠLearned Metrics
Hong Mong 5 Development Treasure Case Sharing Buried Point Development Real Battle Guide
dev.toยท19hยท
Discuss: DEV
๐Ÿ”—Data Provenance
Accurate and Energy Efficient: Local Retrieval-Augmented Generation Models Outperform Commercial Large Language Models in Medical Tasks
arxiv.orgยท12h
๐ŸŒ€Brotli Internals
Machine Learning Fundamentals: active learning tutorial
dev.toยท1dยท
Discuss: DEV
๐ŸŽ›๏ธFeed Filtering
Multilingual Tokenization through the Lens of Indian Languages: Challenges and Insights
arxiv.orgยท2d
๐Ÿ“Text Parsing
Resource-Friendly Dynamic Enhancement Chain for Multi-Hop Question Answering
arxiv.orgยท2d
๐Ÿ”Information Retrieval
The Power of Strong Linearizability: the Difficulty of Consistent Refereeing
arxiv.orgยท2d
๐ŸŽฏPerformance Proofs
Structured data response with Amazon Bedrock: Prompt Engineering and Tool Use
aws.amazon.comยท1h
๐ŸŒ€Brotli Internals
Black-Box Test Code Fault Localization Driven by Large Language Models and Execution Estimation
arxiv.orgยท1d
๐Ÿ”Concolic Testing
The most efficient algorithm for detecting claws in general graphs, with a runtime of O(m ฮ”) โ€” where m is the number of edges and ฮ” is the maximum degree โ€” is n...
dev.toยท1dยท
Discuss: DEV
๐Ÿ”—Topological Sorting
Introduction to Algorithms: What They Are and Why They Matter
dev.toยท2dยท
Discuss: DEV
๐ŸงฎKolmogorov Complexity
Loading...Loading more...
AboutBlogChangelogRoadmap