Nedials, Nedians, and some related triangles and some properties
pballew.blogspot.comยท13hยท
Discuss: www.blogger.com
๐Ÿ“ŠComputational Geometry
derived set
ncatlab.orgยท4h
๐ŸงฎAlgebraic Archives
2025-06-24: GPU Hours Granted on Hypothesis Generation by Oak Ridge Leadership Computing Facility
ws-dl.blogspot.comยท1dยท
Discuss: ws-dl.blogspot.com
๐Ÿด๓ ง๓ ข๓ ณ๓ ฃ๓ ด๓ ฟScottish Computing
Introduction to the Fundamentals of Amazon Redshift
redshift-observatory.chยท11h
๐Ÿ—ƒ๏ธDatabase Storage
Why Dyad?: A Perspective for Modelica Users
juliahub.comยท4hยท
Discuss: Hacker News
๐Ÿ’งLiquid Types
An All-Around Better Horse
patrickhebron.comยท2hยท
Discuss: Hacker News
๐Ÿง Knowledge Management
Cross-sensor self-supervised training and alignment for remote sensing
arxiv.orgยท15h
๐Ÿ“ŠLearned Metrics
Layout Overview
dev.toยท4hยท
Discuss: DEV
๐Ÿ“‹Document Layout
Local Elasticsearch Playground: A Practical Introduction and hands-on test (and moving to a RAG solution)
dev.toยท1dยท
Discuss: DEV
๐ŸบZIP Archaeology
Empowering Graph-based Approximate Nearest Neighbor Search with Adaptive Awareness Capabilities
arxiv.orgยท2d
๐Ÿ”Proximity Search
Rapeseed population point cloud completion network (RP-PCN) with dynamic graph convolution for 3D reconstruction of crop canopy occlusion architecture
arxiv.orgยท1d
๐ŸบComputational Archaeology
Computing Betti tables and minimal presentations of zero-dimensional persistent homology
arxiv.orgยท1d
๐Ÿ•ธ๏ธAlgebraic Topology
Using Wavelets and Clustering to Predict Odd or Even Numbers: An Overengineered Approach with Pretty (But Confusing) Plots
dev.toยท5hยท
Discuss: DEV
๐Ÿง Machine Learning
Granular-Ball-Induced Multiple Kernel K-Means
arxiv.orgยท1d
๐ŸŒ€Differential Geometry
Portable Network Graphics (PNG) Specification (Third Edition)
w3.orgยท23hยท
Discuss: Hacker News
๐Ÿ•ธ๏ธWebP Analysis
Measuring Fractal Dimension using Discrete Global Grid Systems
arxiv.orgยท1d
๐Ÿ“ŠComputational Geometry
NaviAgent: Bilevel Planning on Tool Dependency Graphs for Function Calling
arxiv.orgยท15h
๐Ÿ”—Topological Sorting
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
Uncertainty Quantification on Graph Learning: A Survey
arxiv.orgยท15h
๐Ÿ•ธ๏ธGraph Embeddings
Angio-Diff: Learning a Self-Supervised Adversarial Diffusion Model for Angiographic Geometry Generation
arxiv.orgยท15h
๐ŸŒ€Riemannian Computing