Tag
Facebook is reportedly paying controversial creators to generate rage-bait content, raising concerns about algorithmic incentives and platform moderation.
The paper presents a two-level algorithm for allocating a conserved capacity budget across locations and service classes, proving it conserves the budget and converges in one iteration, and evaluates it for defending CDNs under volumetric attack.
Tony Finch revisits his Gregorian-to-Julian day conversion algorithm, incorporating tricks from Ben Joffe to produce a more efficient and robust formula.
A project defining a color space for generating diverse human skin tones, with simple algorithms and an interactive color picker.
A developer deep dive into an NLP-based grocery categorization tool, covering input lexing, stemming, and a unigram database approach to classify products into categories.
This paper presents a randomized algorithm that solves k-coloring on n-vertex graphs in time (2-ε_k)^n for every fixed k, resolving a long-standing open problem in exponential-time algorithms. It builds on hypergraph containers and list-coloring reductions.
This paper proposes a k-order relaxation of the faithfulness assumption for learning graphical Markov blankets, and introduces a proof-of-concept algorithm (kOMB) that can recover Markov blankets even under violations of faithfulness, such as parity-type relationships.
This video details the principles of the Fast Multipole Method (FMM) for achieving N-body gravity simulation in O(N) time, including multipole expansions and local expansions, and compares it with the naive O(N²) and Barnes-Hut algorithms.
The article details how Douglas McIlroy compressed a 250kB dictionary into 64kB RAM for Unix spell using stemming, Bloom filters, and Golomb coding, achieving near-theoretical-limit compression.
A writer spent six weeks running a faceless AI persona account to test the viability of passive income, using tools like APOB AI, ElevenLabs, and CapCut, and concluded that the economics are poor and the distribution problem remains unsolved.
This page describes the spacefilling curve heuristic for generating approximate solutions to the Traveling Salesman Problem, emphasizing its speed, simplicity, and practical applications in routing, logistics, and map drawing.
This paper introduces ALP, a state-of-the-art lossless compression algorithm for IEEE 754 floating-point data, exploiting decimal and high-precision patterns. It achieved superior performance in decoding speed, compression ratio, and compression speed, earning the SIGMOD Best Artifact Award.
An explanation of Perlin's noise algorithm, covering the concept of noise, coherent noise, and the basics of implementing noise functions in procedural generation.
A Chinese professor has discovered a new deterministic shortest path algorithm that beats the 40-year-old sorting barrier by combining Dijkstra and Bellman-Ford with frontier reduction, achieving O(m log^(2/3) n) time on sparse graphs.
This paper describes a scanline edge-flag algorithm for antialiasing in computer graphics rendering.
Proposes Big-means++, a simple algorithm that achieves global optimization quality for big data K-means clustering by systematically curating inputs and using sample-induced surrogate landscapes.
X's head of product admits the algorithm was missing data on mutual followers, making reply sections feel like a battleground; a tweak now boosts visibility of posts to mutuals to foster community.
This paper presents IsalHG, a method to represent any finite connected hypergraph as a string over a compact instruction alphabet, decoded by a virtual machine. It introduces a canonical string conjecture for hypergraph isomorphism and benchmarks against established methods.
Google explains why searching for the word 'Jew' returns anti-Semitic results, attributing it to algorithmic ranking and linguistic usage, and apologizes for the upsetting experience.
Proposes Efficient Long-horizon Optimization (ELO) learning, a meta-training algorithm that reallocates compute to longer horizons and uses decoupled progressive expert supervision, improving learned optimizers' performance on long-unroll tasks and out-of-distribution generalization. ELO-Celo2 consistently outperforms AdamW and matches Muon on language modeling tasks.