🐿️ ScourBrowse
LoginSign Up
You are offline. Trying to reconnect...
Copied to clipboard
Unable to share or copy to clipboard
🌳 Huffman Variants

Canonical Huffman, Length-Limited Codes, Optimal Prefix Trees, Adaptive Huffman

Terminology: asymptotically unbiased
notstatschat.rbind.ioΒ·1d
🧠Machine Learning
Networking for Systems Administrators
mwl.ioΒ·1dΒ·
Discuss: Hacker News
🌐DNS over QUIC
Why Most SBOMs Fail and What to Do About It
ovalenzuela.comΒ·4hΒ·
Discuss: Hacker News
βœ…Format Validation
Show HN: Requests-Based Google Maps Scraper
apify.comΒ·23hΒ·
Discuss: Hacker News
πŸ”BitFunnel
The collective waste caused by poor documentation
shanrauf.comΒ·1dΒ·
Discuss: Hacker News
πŸ“¦Deflate
Small language model for secrets detection
wiz.ioΒ·3dΒ·
Discuss: Hacker News
πŸ’»Local LLMs
Passwordless Auth: a JSON-Based Approach for modern authentication w/ SSSD & GNOME - DevConf.CZ 2025
youtube.comΒ·11h
πŸ”“Password Cracking
8 Essential Python Patterns for Building Bulletproof APIs That Scale
dev.toΒ·2dΒ·
Discuss: DEV
πŸŒ€Brotli Internals
C++ Seeding Surprises (2015)
pcg-random.orgΒ·1dΒ·
Discuss: Hacker News
πŸ”’Bitwise Algorithms
RL-Driven Semantic Compression Model Selection and Resource Allocation in Semantic Communication Systems
arxiv.orgΒ·2d
β§—Information Bottleneck
Distribution of codewords on the faces of a hypercube and new combinatorial identities
arxiv.orgΒ·2d
⚽Sphere Packing
CodeMorph: Mitigating Data Leakage in Large Language Model Assessment
arxiv.orgΒ·2d
πŸ’»Local LLMs
MFTCXplain: A Multilingual Benchmark Dataset for Evaluating the Moral Reasoning of LLMs through Hate Speech Multi-hop Explanation
arxiv.orgΒ·1d
βš™οΈCompression Benchmarking
βš”οΈ The Josephus Problem Explained: Constant-Time Solution for k = 2
dev.toΒ·9hΒ·
Discuss: DEV
🌳Trie Structures
Using Wavelets and Clustering to Predict Odd or Even Numbers: An Overengineered Approach with Pretty (But Confusing) Plots
dev.toΒ·1dΒ·
Discuss: DEV
🧠Machine Learning
Human Voice is Unique
arxiv.orgΒ·2d
πŸ‘‚Audio Evidence
An AI Agent That Interprets Papers So You Don’t Have To: Full Build Guide
hackernoon.comΒ·8h
πŸ”¬Academic Search
🚦 Dijkstra's Algorithm Explained – A Beginner's Guide
dev.toΒ·9hΒ·
Discuss: DEV
πŸ•ΈοΈGraph Algorithms
Accurate and Energy Efficient: Local Retrieval-Augmented Generation Models Outperform Commercial Large Language Models in Medical Tasks
arxiv.orgΒ·15h
πŸŒ€Brotli Internals
Safe Pruning LoRA: Robust Distance-Guided Pruning for Safety Alignment in Adaptation of LLMs
arxiv.orgΒ·1d
πŸ’»Local LLMs
Loading...Loading more...
AboutBlogChangelogRoadmap