TE
科技回声
首页24小时热榜最新最佳问答展示工作
GitHubTwitter
首页

科技回声

基于 Next.js 构建的科技新闻平台,提供全球科技新闻和讨论内容。

GitHubTwitter

首页

首页最新最佳问答展示工作

资源链接

HackerNews API原版 HackerNewsNext.js

© 2025 科技回声. 版权所有。

Loop Perforation (2019)

16 点作者 Jonhoo超过 3 年前

3 条评论

touisteur超过 3 年前
I think this is a <i>very</i> elaborate joke, though I was always surprised by some linear algebra algorithms that had a &#x27;cooking recipe&#x27; feeling (looking at you svd) of &#x27;loop enough time to get better results&#x27;...
seg_lol超过 3 年前
When your operations are statistical in nature, as Approximate Computing is, so then these operations themselves are different sampling methods.<p>If the for loop is calculating a sum, but that value only needs to be over a threshold, there is no reason to add the whole thing, you need a proper sample size and distribution and that it what Loop Perforation is giving you in this case.
dreamcompiler超过 3 年前
The way you add the integers up to n is<p>n(n+1)&#x2F;2.<p>Fixed that for you. No loops, and it&#x27;s exact. Pick a better example.