๐Ÿ“Š HyperLogLog

Cardinality Estimation, Sketching Algorithms, Stream Processing, Probabilistic Counting

Show HN: Logcat.ai โ€“ AI-powered observability for Operating Systems | Free Beta
logcat.aiยท1dยท
Discuss: Hacker News
๐Ÿ”eBPF
Show HN: Requests-Based Google Maps Scraper
apify.comยท3hยท
Discuss: Hacker News
๐Ÿ”BitFunnel
Greedy Is Good. Less Greedy May Be Better
gojiberries.ioยท23hยท
Discuss: Hacker News
๐ŸงฎKolmogorov Complexity
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
Shrinking the Generation-Verification Gap with Weak Verifiers
arxiv.orgยท1d
๐ŸงชCBOR Fuzzing
Exploring High Efficiency Web Analysis Results๏ผˆ1750876031390300๏ผ‰
dev.toยท5hยท
Discuss: DEV
๐ŸŒŠStream Processing
Uncertainty Quantification on Graph Learning: A Survey
arxiv.orgยท20h
๐Ÿ•ธ๏ธGraph Embeddings
Sheaf Hypergraph Networks
arxiv.orgยท2d
๐ŸŒ€Hyperbolic Geometry
Machine Learning Fundamentals: active learning with python
dev.toยท6hยท
Discuss: DEV
๐Ÿง Machine Learning
Curating art exhibitions using machine learning
arxiv.orgยท20h
๐ŸบComputational Archaeology
Dual-Hierarchy Labelling: Scaling Up Distance Queries on Dynamic Road Networks
arxiv.orgยท1d
๐Ÿ“Range Queries
Learning-aided Bigraph Matching Approach to Multi-Crew Restoration of Damaged Power Networks Coupled with Road Transportation Networks
arxiv.orgยท20h
๐Ÿ•ธ๏ธGraph Algorithms
CORONA: A Coarse-to-Fine Framework for Graph-based Recommendation with Large Language Models
arxiv.orgยท1d
๐Ÿ”Information Retrieval
Machine Learning Fundamentals: active learning project
dev.toยท8hยท
Discuss: DEV
๐Ÿง Machine Learning
CLGRPO: Reasoning Ability Enhancement for Small VLMs
arxiv.orgยท1d
๐Ÿ“Linear Logic
Machine Learning Fundamentals: accuracy project
dev.toยท2dยท
Discuss: DEV
โœ…Archive Validation
Plan for Speed -- Dilated Scheduling for Masked Diffusion Language Models
arxiv.orgยท20h
๐Ÿ’ปLocal LLMs
Perfect phylogenies via the Minimum Uncovering Branching problem: efficiently solvable cases
arxiv.orgยท1d
๐ŸงฎKolmogorov Complexity
Machine Learning Fundamentals: active learning
dev.toยท1dยท
Discuss: DEV
๐Ÿค–Grammar Induction
DRIFT: Data Reduction via Informative Feature Transformation- Generalization Begins Before Deep Learning starts
arxiv.orgยท20h
๐Ÿง Machine Learning