# reduction Published articles for reduction. This is one page of public article previews, not the complete archive. Follow Next page to continue. Summaries are not the original full articles. ## How tetrahedral cages significantly reduce BVH memory usage DevFeed: [How tetrahedral cages significantly reduce BVH memory usage]() Original publisher: [Read original article]() Author: Holger Gruen Published: 2026-09-17T13:00:00Z Content type: tutorial Language: en Sources: [AMD GPUOpen]() Topics: [GPU](), [Graphics](), [Simulation and Design]() Tags: [animation](), [article-release](), [directx](), [fps](), [game-development](), [graphics](), [graphics-apis](), [memory](), [microsoft-directx](), [optimization](), [performance](), [ray-tracing](), [raytracing](), [reduction](), [research](), [technical-article](), [technical-articles](), [white-paper]() ### AI overview This article explains how tetrahedral cages reduce BVH memory usage and update costs when ray tracing independently animated geometry. In an AMD sample with animated plants, the technique uses about 1.7 GB of BVH memory and approximately 3.3 ms for BVH updates per frame, compared with up to 80 GB and more than 300 ms for conventional dense triangle BLAS updates on a Radeon RX 9070 XT GPU. ### Source excerpt The AMD tetrahedral cage technique ray traces 25,000 independently animated plants at 60+ FPS while slashing BVH memory and update costs for massive dynamic scenes. ## How Rain Affects Wireless Microwave Links: 24 GHz, 60 GHz, and 80 GHz Compared DevFeed: [How Rain Affects Wireless Microwave Links: 24 GHz, 60 GHz, and 80 GHz Compared]() Original publisher: [Read original article]() Author: j2sw Published: 2026-06-15T09:47:43Z Content type: tutorial Language: en Sources: [Justin Wilson (j2sw)]() Topics: [Network](), [Network design](), [Internet](), [data centers]() Tags: [24ghz](), [60ghz](), [80ghz](), [adaptive](), [backhaul](), [capacity](), [changes](), [e-band](), [error-correction](), [fiber](), [microwave](), [network](), [network-design](), [perfomance](), [radio](), [reduction](), [rf](), [wireless](), [wireless-networking]() ### AI overview This article explains how rain fade affects wireless microwave links, with emphasis on 24 GHz, 60 GHz, and 80 GHz bands. It describes how precipitation reduces signal strength, causes adaptive modulation and throughput reductions, and can eventually cause a link to drop when fade margin is exhausted. ### Source excerpt Rain can have a major impact on wireless microwave links, especially as frequencies increase. Learn how rain fade affects 24 GHz, 60 GHz, and 80 GHz circuits, and why fade margin is critical for reliable network design. The post How Rain Affects Wireless Microwave Links: 24 GHz, 60 GHz, and 80 GHz Compared appeared first on Justin Wilson (j2sw). ## Using the Frisch-Waugh-Lovell Theorem to Improve CUPED Variance Reduction in Online Experiments DevFeed: [Using the Frisch-Waugh-Lovell Theorem to Improve CUPED Variance Reduction in Online Experiments]() Original publisher: [Read original article]() Author: Evan Miller Published: 2022-07-15T00:35:00Z Content type: tutorial Language: en Sources: [Evan Miller]() Topics: [experiments](), [math](), [data]() Tags: [analysis](), [experiments](), [math](), [reduction](), [variance]() ### AI overview This tutorial explains the mathematical connection between CUPED and partial linear regression through the Frisch-Waugh-Lovell Theorem. It discusses how variance reduction can decrease experiment sample sizes and proposes including a vector of treatments in CUPED regressions for additional variance reduction. ### Source excerpt A/B tests run faster with CUPED. Here I explain the underlying math, and use it to invent an even better variance-reduction technique for online experiments: You Can't Spell CUPED Without Frisch-Waugh-Lovell ## The Halting Problem DevFeed: [The Halting Problem]() Original publisher: [Read original article]() Published: 2014-07-27T00:00:00Z Content type: article Language: en Sources: [Radek Pazdera]() Topics: [Computer science](), [Algorithm](), [Math and Logic]() Tags: [algorithm](), [computer-science](), [computers](), [halting-problem](), [infinite](), [input](), [logic](), [loops](), [program](), [reduction]() ### AI overview The article explains Alan Turing's halting problem: no general method can always determine whether an arbitrary program will halt or run forever. It describes the problem's connection to undecidability, diagonalization, and reductions, and briefly discusses Turing's work with Alonzo Church. ### Source excerpt And other things computers cannot solve ## A problem that is not (properly) PAC-learnable DevFeed: [A problem that is not (properly) PAC-learnable]() Original publisher: [Read original article]() Published: 2014-04-21T10:00:16Z Content type: tutorial Language: en Sources: [Jeremy Kun]() Topics: [Learning](), [math](), [Math and Logic]() Tags: [algorithm](), [boolean](), [boolean-satisfiability](), [classes](), [computational-complexity](), [computational-learning-theory](), [learning-theory](), [logical](), [math](), [mathematics](), [misconceptions](), [np](), [np-completeness](), [pac-learning](), [reduction](), [rp]() ### AI overview This technical learning-theory article presents a standard example of a problem that is not learnable under the previously introduced PAC model, then explains how a more expressive hypothesis class changes that result. Its addendum clarifies that 3-term DNF formulas are not shown to be unlearnable under the standard PAC definition, only under the earlier restricted definition. ### Source excerpt In a previous post we introduced a learning model called Probably Approximately Correct (PAC). We saw an example of a concept class that was easy to learn: intervals on the real line (and more generally, if you did the exercise, axis-aligned rectangles in a fixed dimension). One of the primary goals of studying models of learning is to figure out what is learnable and what is not learnable in the various models.