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

科技回声

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

GitHubTwitter

首页

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

资源链接

HackerNews API原版 HackerNewsNext.js

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

Best Paper Awards in Computer Science over the past 25 years

159 点作者 lazyjeff超过 3 年前

9 条评论

lazyjeff超过 3 年前
Surprised to see this here, because I don&#x27;t remember reposting this today (but I did post a couple days ago after midnight and nothing happened), so maybe it&#x27;s some @dang magic.<p>Anyways, I recently updated this collection over the new year (with a bit of help from two students). It&#x27;s not meant to be a comprehensive list of all best paper awards, but a fairly representative one across the main conferences in computer science. I guess I think of it as the Oscars (Academy Awards) of Computer Science Papers. It originated because award announcements and conference websites disappear quickly because each year a different organizer manages the website, so this information is lost forever. And I wanted a way to look back and see what people thought was the best paper in that year to see if those paper indeed made an impact.<p>Those who are more quantitative may be interested in this aggregated list of which institutions produce the most best paper awards: <a href="https:&#x2F;&#x2F;jeffhuang.com&#x2F;best_paper_awards&#x2F;institutions.html" rel="nofollow">https:&#x2F;&#x2F;jeffhuang.com&#x2F;best_paper_awards&#x2F;institutions.html</a> And the interesting thing that came out of it is the number of best paper awards is highly correlated with the US News ranking of computer science departments (which is purely based on subjective surveys of department chairs and graduate directors): <a href="https:&#x2F;&#x2F;drafty.cs.brown.edu&#x2F;csopenrankings&#x2F;" rel="nofollow">https:&#x2F;&#x2F;drafty.cs.brown.edu&#x2F;csopenrankings&#x2F;</a>
评论 #29818985 未加载
评论 #29819096 未加载
评论 #29819246 未加载
knuthsat超过 3 年前
It&#x27;s just amazing how DL made most work completely irrelevant.<p>Stuff before 2010 in natural language processing is ridiculous. Dynamic programming algorithms, beam search, dependency parsing (grammar) algorithms (going from O(n^3) to O(n) with cost-sensitive algorithms), a huge focus on lexical analysis, part-of-speech, graphical models (maximum entropy, conditional random fields, etc.).<p>Today all of these algorithms are completely irrelevant. No one needs part-of-speech anymore, or dependency (grammar) trees, or cost-sensitive reinforcement learning reductions.<p>I remember being so inspired by all of the work and learned a lot, but it&#x27;s quite funny how Lindy works.
评论 #29817533 未加载
评论 #29818959 未加载
评论 #29819131 未加载
评论 #29818869 未加载
alexhawke超过 3 年前
No papers from SIGARCH? :(
评论 #29822958 未加载
评论 #29820674 未加载
Ar-Curunir超过 3 年前
Only semi-serious suggestion: for security I would add USENIX Security, EUROCRYPT and CRYPTO.
bawolff超过 3 年前
CHI seems to have quite a gamut of paper subjects.
评论 #29818625 未加载
compsciphd超过 3 年前
they left out mobicom papers before 2009 (one of them is mine :) so I&#x27;m a bit biased), yes the title changed, but mobicom obviously considers it equivalent<p><a href="https:&#x2F;&#x2F;beta.sigmobile.org&#x2F;articles&#x2F;mobicom-best-paper-award" rel="nofollow">https:&#x2F;&#x2F;beta.sigmobile.org&#x2F;articles&#x2F;mobicom-best-paper-award</a>
评论 #29826933 未加载
AnthonBerg超过 3 年前
My personal awards for the best computer science papers go to Conor McBride and Per Martin-Löf.
m0ksha超过 3 年前
Nice work. The historical view of where research is going is great to see.
maxwell86超过 3 年前
No supercomputing ? :(<p>No parallelism ? :(