Best Paper Collection

Much of this data was entered by hand (obtained by contacting past conference organizers, retrieving cached conference websites, and searching CVs) so please email me if you notice any errors or omissions: I tried to collect best paper awards from the top-tier conferences in each area, but some conferences do not have such an award (e.g. SIGGRAPH, CAV) or have only started issuing this award recently (e.g. SODA, SIGCOMM, IEEE S&P). “Distinguished paper award” and “outstanding paper award” were also collected but “best student paper” (e.g. NIPS) or “best 10-year old paper” (e.g. POPL) were not collected.

AAAI (Artificial Intelligence)
2011 Dynamic Resource Allocation in Conservation Planning Daniel Golovin, California Institute of Technology; et al.
Complexity of and Algorithms for Borda Manipulation Jessica Davies, University of Toronto; et al.
2010 How Incomplete Is Your Semantic Web Reasoner? Systematic Analysis of the Completeness of Query Answe… Giorgos Stoilos, Oxford University; et al.
A Novel Transition Based Encoding Scheme for Planning as Satisfiability Ruoyun Huang, Washington University in St. Louis; et al.
2008 How Good is Almost Perfect? Malte Helmert & Gabriele Röger, Albert-Ludwigs-Universität Freiburg
Optimal False-Name-Proof Voting Rules with Costly Voting Liad Wagman & Vincent Conitzer, Duke University
2007 PLOW: A Collaborative Task Learning Agent James Allen, Institute for Human and Machine Cognition; et al.
Thresholded Rewards: Acting Optimally in Timed, Zero-Sum Games Colin McMillen & Manuela Veloso, Carnegie Mellon University
2006 Model Counting: A New Strategy for Obtaining Good Bounds Carla P. Gomes, Cornell University; et al.
Towards an Axiom System for Default Logic Gerhard Lakemeyer, RWTH Aachen University
Hector J. Levesque, University of Toronto
2005 The Max K- Armed Bandit: A New Model of Exploration Applied to Search Heuristic Selection Vincent A. Cicirello, Drexel University
Stephen F. Smith, Carnegie Mellon University
2004 Learning and Inferring Transportation Routines Lin Liao, University of Washington; et al.
2002 On Computing All Abductive Explanations Thomas Eiter, Technische Universität Wien
Kazuhisa Makino, Osaka University
2000 The Game of Hex: An Automatic Theorem-Proving Approach to Game Programming Vadim V. Anshelevich, Vanshel Consulting
1999 PROVERB: The Probabilistic Cruciverbalist Greg A. Keim, Duke University; et al.
1998 Learning Evaluation Functions for Global Optimization and Boolean Satisfiability Justin A. Boyan & Andrew W. Moore, Carnegie Mellon University
Acceleration Methods for Numeric CSPs Yahia Lebbah & Olivier Lhomme, Ecole des Mines de Nantes
The Interactive Museum Tour-Guide Robot Wolfram Burgard, University of Bonn; et al.
1997 Statistical Parsing with a Context-Free Grammar and Word Statistics Eugene Charniak, Brown University
A Practical Algorithm for Finding Optimal Triangulations Krill Shoikhet & Dan Geiger, Technion
Fast Context Switching in Real-Time Propositional Reasoning P. Pandurang Nayak & Brian C. Williams, NASA Ames Research Center
Building Concept Representations from Reusable Components Peter Clark, Boeing
Bruce Porter, University of Texas at Austin
1996 Verification of Knowledge Bases Based on Containment Checking Alon Y. Levy, AT&T Laboratories
Marie-Christine Rousset, Université Paris-Sud
A Novel Application of Theory Refinement to Student Modeling Paul T. Baffes, SciComp
Raymond J. Mooney, University of Texas at Austin
Pushing the Envelope: Planning, Propositional Logic, and Stochastic Search Henry Kautz & Bart Selman, AT&T Laboratories
ACL (Natural Language Processing)
2011 Unsupervised Part-of-Speech Tagging with Bilingual Graph-Based Projections Dipanjan Das, Carnegie Mellon University
Slav Petrov, Google
2010 Beyond NomBank: A Study of Implicit Arguments for Nominal Predicates Matthew Gerber & Joyce Y. Chai, Michigan State University
2009 Reinforcement Learning for Mapping Instructions to Actions S.R.K. Branavan, Massachusetts Institute of Technology; et al.
K-Best A* Parsing Adam Pauls & Dan Klein, University of California Berkeley
Concise Integer Linear Programming Formulations for Dependency Parsing André F.T. Martins, Instituto de Telecomunicações; et al.
2008 Forest Reranking: Discriminative Parsing with Non-Local Features Liang Huang, University of Pennsylvania
A New String-to-Dependency Machine Translation Algorithm with a Target Dependency Language Model Libin Shen, BBN Technologies; et al.
2007 Learning synchronous grammars for semantic parsing with lambda calculus Yuk Wah Wong & Raymond J. Mooney, University of Texas at Austin
2006 Semantic taxonomy induction from heterogenous evidence Rion Snow, Stanford University; et al.
2005 A Hierarchical Phrase-Based Model for Statistical Machine Translation David Chiang, University of Maryland
2004 Finding Predominant Word Senses in Untagged Text Diana McCarthy, University of Sussex; et al.
2003 Accurate Unlexicalized Parsing Dan Klein & Christopher D. Manning, Stanford University
Towards a Model of Face-to-Face Grounding Yukiko I. Nakano, RISTEX; et al.
2002 Discriminative Training and Maximum Entropy Models for Statistical Machine Translation Franz Josef Och & Hermann Ney, RWTH Aachen University
2001 Immediate-Head Parsing for Language Models Eugene Charniak, Brown University
Fast Decoding and Optimal Decoding for Machine Translation Ulrich Germann, University of Southern California; et al.
CHI (Human-Computer Interaction)
2011 Usable Gestures for Blind People: Understanding Preference and Performance Shaun K. Kane, University of Washington; et al.
Effects of Community Size and Contact Rate in Synchronous Social Q&A Ryen W. White, Microsoft Research; et al.
Teenagers and Their Virtual Possessions: Design Opportunities and Issues William Odom, Carnegie Mellon University; et al.
Enhancing Physicality in Touch Interaction with Programmable Friction Vincent Levesque, University of British Columbia; et al.
Mid-air Pan-and-Zoom on Wall-sized Displays Mathieu Nancel, Université Paris-Sud; et al.
Bricolage: Example-Based Retargeting for Web Design Ranjitha Kumar, Stanford University; et al.
Synchronous Interaction Among Hundreds: An Evaluation of a Conference in an Avatar-based Virtual Env… Thomas Erickson, IBM Research; et al.
In the Shadow of Misperception: Assistive Technology Use and Social Interactions Kristen Shinohara & Jacob O. Wobbrock, University of Washington
Why is My Internet Slow?: Making Network Speeds Visible Marshini Chetty, Georgia Institute of Technology; et al.
Ease of Juggling: Studying the Effects of Manual Multitasking Antti Oulasvirta & Joanna Bergstrom-Lehtovirta, Aalto University
Automics: souvenir generating photoware for theme parks Abigail Durrant, University of Nottingham; et al.
Your Noise is My Command: Sensing Gestures Using the Body as an Antenna Gabe Cohn, University of Washington; et al.
Review Spotlight: A User Interface for Summarizing User-generated Reviews Using Adjective-Noun Word … Koji Yatani, University of Toronto; et al.
2010 Lumino: Tangible Blocks for Tabletop Computers Based on Glass Fiber Bundles Patrick Baudisch, Hasso Plattner Institute; et al.
Mapping the Landscape of Sustainable HCI Carl DiSalvo, Georgia Institute of Technology; et al.
Occlusion-Aware Interfaces Daniel Vogel & Ravin Balakrishnan, University of Toronto
Avaaj Otalo — A Field Study of an Interactive Voice Forum for Small Farmers in Rural India Neil Patel, Stanford University; et al.
How does search behavior change as search becomes more difficult? Anne Aula, Google; et al.
The Tower of Babel Meets Web 2.0: User-Generated Content and its Applications in a Multilingual Cont… Brent Hecht & Darren Gergle, Northwestern University
Skinput: Appropriating the Body as an Input Surface Chris Harrison, Carnegie Mellon University; et al.
Mobile-izing Health Workers in Rural India Divya Ramachandran, University of California Berkeley; et al.
The Design of Eco-Feedback Technology Jon Froehlich, University of Washington; et al.
Feminist HCI: Taking Stock and Outlining an Agenda for Design Shaowen Bardzell, Indiana University at Bloomington
Prefab: Implementing Advanced Behaviors Using Pixel-Based Reverse Engineering of Interface Structure Morgan Dixon & James Fogarty, University of Washington
Useful Junk? The Effects of Visual Embellishment on Comprehension and Memorability of Charts Scott Bateman, University of Saskatchewan; et al.
2009 From Interaction to Trajectories: Designing Coherent Journeys Through User Experiences Steve Benford, University of Nottingham; et al.
Sizing the Horizon: The Effects of Chart Size and Layering on the Graphical Perception of Time Serie… Jeffrey Heer, Stanford University; et al.
Predicting Tie Strength With Social Media Eric Gilbert & Karrie Karahalios, University of Illinois at Urbana-Champaign
Musink: Composing Music through Augmented Drawing Theophanis Tsandilas, Université Paris-Sud; et al.
Social Immersive Media: Pursuing Best Practices for Multi-user Interactive Camera/Projector Exhibits Scott S. Snibbe, Sona Research
Hayes S. Raffle, Massachusetts Institute of Technology
Ephemeral Adaptation: The Use of Gradual Onset to Improve Menu Selection Performance Leah Findlater, University of British Columbia; et al.
Undo and Erase Events as Indicators of Usability Problems David Akers, Stanford University; et al.
2008 In-Car GPS Navigation: Engagement with and Disengagement from the Environment Gilly Leshed, Cornell University; et al.
Improving the Performance of Motor-Impaired Users with Automatically-Generated, Ability-Based Interf… Krzysztof Z. Gajos, University of Washington; et al.
Large Scale Analysis of Web Revisitation Patterns Eytan Adar, University of Washington; et al.
Designs on Dignity: Perceptions of Technology Among the Homeless Christopher A. Le Dantec & W. Keith Edwards, Georgia Institute of Technology
The Network in the Garden: An Empirical Analysis of Social Media in Rural Life Eric Gilbert, University of Illinois at Urbana-Champaign; et al.
Multimodal collaborative handwriting training for visually-impaired people Beryl Plimmer, University of Auckland; et al.
An Error Model for Pointing Based on Fitts’ Law Jacob O. Wobbrock, University of Washington; et al.
2007 Multiview: improving trust in group video conferencing through spatial faithfulness David T. Nguyen & John Canny, University of California Berkeley
Software or wetware?: discovering when and why people use digital prosthetic memory Vaiva Kalnikaité & Steve Whittaker, University of Sheffield
Shift: a technique for operating pen-based interfaces using touch Daniel Vogel, University of Toronto
Patrick Baudisch, Microsoft Research
Authoring sensor-based interactions by demonstration with direct manipulation and pattern recognitio… Björn Hartmann, Stanford University; et al.
Sustainable interaction design: invention & disposal, renewal & reuse Eli Blevis, Indiana University at Bloomington
Consuming video on Mobile devices Kenton O’Hara, Hewlett-Packard Labs; et al.
2006 Trackball text entry for people with motor impairments Jacob O. Wobbrock & Brad Myers, Carnegie Mellon University
Embedded phenomena: supporting science learning with classroom-sized distributed simulations Tom Moher, University of Illinois at Chicago
A role for haptics in mobile interaction: initial design using a handheld tactile display prototype Joseph Luk, University of British Columbia; et al.
2005 Making space for stories: ambiguity in the design of personal communication systems Paul M. Aoki, Palo Alto Research Center
Allison Woodruff, Intel Research
Examining Task Engagement in Sensor-Based Statistical Models of Human Interruptibility James Fogarty, Carnegie Mellon University; et al.
Designing the spectator experience Stuart Reeves, University of Nottingham; et al.
The bubble cursor: enhancing target acquisition by dynamic resizing of the cursor’s activation area Tovi Grossman & Ravin Balakrishnan, University of Toronto
CIKM (Knowledge Management)
2011 Intent-aware query similarity Jiafeng Guo, Chinese Academy of Sciences; et al.
2010 MENTA: Inducing Multilingual Taxonomies from Wikipedia Gerard de Melo & Gerhard Weikum, Max Planck Institut
FACeTOR: cost-driven exploration of faceted query results Abhijith Kashyap, State University of New York at Buffalo; et al.
2009 On the Feasibility of Multi-Site Web Search Engines Ricardo Baeza-Yates, Yahoo! Research; et al.
2008 Learning to Link with Wikipedia David Milne & Ian H. Witten, Univerisity of Waikato
2007 Autonomously Semantifying Wikipedia Fei Wu & Daniel S. Weld, University of Washington
2006 Discovering and Exploiting Keyword and Attribute-Value Co-occurrences to Improve P2P Routing Indices Segabtian Michel, Max Planck Institut; et al.
2005 Towards Automatic Association of Relevant Unstructured Content with Structured Query Results Prasan Roy, IBM Research; et al.
2004 Discovering Frequently Changing Structures from Historical Structural Deltas of Unordered XML Qiankun Zhao, Nanyang Technological University; et al.
CVPR (Computer Vision)
2011 Real-time Human Pose Recognition in Parts from Single Depth Images Jamie Shotton, Microsoft Research; et al.
2010 Efficient Computation of Robust Low-Rank Matrix Approximations in the Presence of Missing Data using… Anders Eriksson & Anton va den Hendel, University of Adelaide
2009 Single Image Haze Removal Using Dark Channel Prior Kaiming He, The Chinese University of Hong Kong; et al.
2008 Global Stereo Reconstruction under Second Order Smoothness Priors Oliver Woodford, University of Oxford; et al.
Beyond Sliding Windows: Object Localization by Efficient Subwindow Search Chistoph H. Lampert, Max Planck Institut; et al.
2007 Dynamic 3D Scene Analysis from a Moving Vehicle Bastian Leibe, ETH Zurich; et al.
2006 Putting Objects in Perspective Derek Hoiem, Carnegie Mellon University; et al.
2005 Real-Time Non-Rigid Surface Detection Julien Pilet, École Polytechnique Fédérale de Lausanne; et al.
2004 Programmable Imaging using a Digital Micromirror Array Shree K. Nayar, Columbia University; et al.
2003 Object Class Recognition by Unsupervised Scale-Invariant Learning Rob Fergus, University of Oxford; et al.
2001 Morphable 3D models from video Matthew Brand, Mitsubishi Electric Research Laboratories
2000 Real-Time Tracking of Non-Rigid Objects using Mean Shift Dorin Comaniciu, Siemens Corporate Research; et al.
FOCS (Theory)
2011 3-SAT Faster and Simpler – Unique-SAT Bounds for PPSZ Hold in General Timon Hertli, ETH Zurich
A Polylogarithmic-Competitive Algorithm for the k-Server Problem Nikhil Bansal, IBM Research; et al.
2010 Approximation Algorithms for the Edge-Disjoint Paths Problem via Raecke Decompositions Matthew Andrews, Bell Labs
Subexponential Algorithms for Unique Games and Related Problems Sanjeev Arora, Princeton University; et al.
Computational Transition at the Uniqueness Threshold Allan Sly, Microsoft Research
2008 Two Query PCP with Sub-Constant Error Dana Moshkovitz & Ran Raz, Weizmann Institute of Science
2007 Space-Efficient Identity Based Encryption Without Pairings Dan Boneh, Stanford University; et al.
2006 Settling the Complexity of 2-Player Nash Equilibrium Xi Chen, Tsinghua University
Xiaotie Deng, City University of Hong Kong
2005 The Unique Games Conjecture, Integrality Gap for Cut Problems and Embeddability of Negative Type Met… Subhash A. Khot, Georgia Institute of Technology
Nisheeth K. Vishnoi, IBM Research
Correcting Errors Beyond the Guruswami-Sudan Radius in Polynomial Time Farzad Parvaresh & Alexander Vardy, University of California San Diego
2004 Cryptography in NC0 Benny Applebaum, Technion; et al.
Hardness of Approximating the Shortest Vector Problem in Lattices Subhash Khot, Georgia Institute of Technology
2003 On the Impossibility of Dimension Reduction in L1 Bo Brinkman & Moses Charikar, Princeton University
2002 A Dichotomy Theorem for Constraints on a Three-Element Set Andrei A. Bulatov, University of Oxford
Minimizing Congestion in General Networks Harald Räcke, Paderborn University
Constant-Round Coin-Tossing with a Man in the Middle or Realizing the Shared Random String Model Boaz Barak, Weizmann Institute of Science
FSE (Software Engineering)
2011 Proactive Detection of Collaboration Conflicts Yuriy Brun, University of Washington; et al.
How Do Fixes Become Bugs? Zuoning Yin, University of Illinois at Urbana-Champaign; et al.
Proving programs robust Swarat Chaudhuri, Rice University; et al.
2010 Creating and evolving developer documentation: understanding the decisions of open source contributo… Barthélémy Dagenais & Martin P. Robillard, McGill University
Developer Fluency: Achieving True Mastery in Software Projects Minghui Zhou, Peking University
Audris Mockus, Avaya Labs
Staged Concurrent Program Analysis Nishant Sinha & Chao Wang, NEC Labs America
2009 Asserting and checking determinism for multithreaded programs Jacob Burnim & Koushik Sen, University of California Berkeley
Darwin: an approach for debugging evolving programs Dawei Qi, National University of Singapore; et al.
Graph-based Mining of Multiple Object Usage Patterns Tung Thanh Nguyen, Iowa State University; et al.
2008 What makes a good bug report? Nicolas Bettenburg, Saarland University; et al.
Efficient online monitoring of web-service SLAs Franco Raimondi, University College London; et al.
2007 Automatic consistency assessment for query results in dynamic environments Jamie Payton, University of North Carolina at Charlotte; et al.
Globally distributed software development project performance: an empirical analysis Narayan Ramasubbu & Rajesh Krishna Balan, Singapore Management University
Mining specifications of malicious behavior Mihai Christodorescu, University of Wisconsin; et al.
Object and reference immutability using Java generics Yoav Zibin, Massachusetts Institute of Technology; et al.
2006 Controlling factors in evaluating path-sensitive error detection techniques Matthew B. Dwyer, University of Nebraska-Lincoln; et al.
SYNERGY: a new algorithm for property checking Bhargav S. Gulavani, Indian Institute of Technology; et al.
2005 Automatic Generation of Suggestions for Program Investigation Martin P. Robillard, McGill University
CUTE: a concolic unit testing engine for C Koushik Sen, University of Illinois at Urbana-Champaign; et al.
Context- and path-sensitive memory leak detection Yichen Xie & Alex Aiken, Stanford University
2004 Reasoning about partial goal satisfaction for requirements and design engineering Emmanuel Letier & Axel van Lamsweerde, Université catholique de Louvain
A classification system and analysis for aspect-oriented programs Martin Rinard, Massachusetts Institute of Technology; et al.
2003 Eliminating redundancies with a “composition with adaptation” meta-programming technique Stan Jarzabek, National University of Singapore
Li Shubiao, Xi’an Jiaotong University
A Family of Test Adequacy Criteria for Database-Driven Applications Gregory M. Kapfhammer & Mary Lou Soffa, University of Pittsburgh
Predicting problems caused by component upgrades Stephen McCamant & Michael D. Ernst, Massachusetts Institute of Technology
2002 Isolating Cause-Effect Chains from Computer Programs Andreas Zeller, Saarland University
ICCV (Computer Vision)
2011 Relative Attributes Devi Parikh, Toyota Technological Institute at Chicago
Kristen Grauman, University of Texas at Austin
2009 Discriminative models for multi-class object layout Chaitanya Desai, University of California Irvine; et al.
2007 Population Shape Regression From Random Design Data Bradley Davis, University of North Carolina at Chapel Hill; et al.
2005 Globally Optimal Estimates for Geometric Reconstruction Problems Fredrik Kahl, Lund University
Didier Henrion, LAAS-CNRS
2003 Detecting Pedestrians using Patterns of Motion and Appearance Paul Viola, Microsoft Research; et al.
Image Parsing: Unifying Segmentation, Detection and Recognition Zhuowen Tu, University of California Los Angeles; et al.
Image-based Rendering using Image-based Priors Andrew Fitzgibbon, University of Oxford; et al.
2001 Probabilistic Tracking with Exemplars in a Metric Space Kentaro Toyama & Andrew Blake, Microsoft Research
The Space of All Stereo Images Steven Seitz, University of Washington
1999 Euclidean Reconstruction and Reprojection up to Subgroups Yi Ma, University of California Berkeley; et al.
A Theory of Shape by Space Carving Kiriakos Kutulakos, University of Rochester
Steven Seitz, Carnegie Mellon University
1998 Self-Calibration and Metric Reconstruction in spite of Varying and Unknown Internal Camera Parameter… Marc Pollefeys, Katholieke Universiteit Leuven; et al.
The Problem of Degeneracy in Structure and Motion Recovery from Uncalibrated Image Sequences Phil Torr, Microsoft Research; et al.
ICML (Machine Learning)
2011 Computational Rationalization: The Inverse Equilibrium Problem Kevin Waugh, Carnegie Mellon University; et al.
2010 Hilbert Space Embeddings of Hidden Markov Models Le Song, Carnegie Mellon University; et al.
2009 Structure preserving embedding Blake Shaw & Tony Jebara, Columbia University
2008 SVM Optimization: Inverse Dependence on Training Set Size Shai Shalev-Shwartz & Nathan Srebro, University of Chicago
2007 Information-theoretic metric learning Jason V. Davis, University of Texas at Austin; et al.
2006 Trading convexity for scalability Ronan Collobert, NEC Labs America; et al.
2005 A support vector method for multivariate performance measures Thorsten Joachims, Cornell University
1999 Least-Squares Temporal Difference Learning Justin A. Boyan, NASA Ames Research Center
ICSE (Software Engineering)
2011 Verifying Multi-threaded Software using SMT-based Context-Bounded Model Checking Lucas Cordeiro & Bernd Fischer, University of Southampton
Configuring Global Software Teams: A Multi-Company Analysis of Project Productivity, Quality, and Pr… Narayan Ramasubbu, Singapore Management University; et al.
Programs, tests, and oracles: the foundations of testing revisited Matt Staats, University of Minnesota; et al.
On-demand Feature Recommendations Derived from Mining Public Product Descriptions Horatiu Dumitru, DePaul University; et al.
Run-Time Efficient Probabilistic Model Checking Antonio Filieri, Politecnico di Milano; et al.
2010 A Machine Learning Approach for Tracing Regulatory Codes to Product Specific Requirements Jane Cleland-Huang, DePaul University; et al.
Collaborative Reliability Prediction of Service-Oriented Systems Zibin Zheng & Michael R. Lyu, The Chinese University of Hong Kong
A Cut-off Approach for Bounded Verification of Parameterized Systems Qiusong Yang & Mingshu Li, Chinese Academy of Sciences
Test Generation through Programming in UDITA Milos Gligoric, University of Illinois at Urbana-Champaign; et al.
A Degree-of-Knowledge Model to Capture Source Code Familiarity Thomas Fritz, University of British Columbia; et al.
2009 How We Refactor, and How We Know It Emerson Murphy-Hill, Portland State University; et al.
Effective Static Deadlock Detection Mayur Naik, Intel Research; et al.
Invariant-Based Automatic Testing of AJAX User Interfaces Ali Mesbah & Arie van Deursen, Delft University of Technology
Does Distributed Development Affect Software Quality? An Empirical Case Study of Windows Vista Christian Bird, University of California Davis; et al.
Automatically finding patches using genetic programming Westley Weimer, University of Virginia; et al.
2008 Precise memory leak detection for java software using container profiling Guoqing Xu & Atanas Rountev, Ohio State University
Debugging reinvented: asking and answering why and why not questions about program behavior Andrew J. Ko & Brad A. Myers, Carnegie Mellon University
Recommending adaptive changes for framework evolution Barthélémy Dagenais & Martin P. Robillard, McGill University
Predicting Accurate and Actionable Static Analysis Warnings: An Experimental Approach Joseph Ruthruff, University of Nebraska-Lincoln; et al.
The effect of program and model structure on mc/dc test adequacy coverage Ajitha Rajan, University of Minnesota; et al.
2007 Refactoring for Parameterizing Java Classes Adam Kiezun, Massachusetts Institute of Technology; et al.
Tracking Code Clones in Evolving Software Ekwa Duala-Ekoko & Martin P. Robillard, McGill University
Matching and Merging of Statecharts Specifications Shiva Nejati, University of Toronto; et al.
Predicting Faults from Cached History Sunghun Kim, Massachusetts Institute of Technology; et al.
2006 Model-Based Development of Dynamically Adaptive Software Ji Zhang & Betty H.C. Cheng, Michigan State University
Who Should Fix This Bug? John Anvik, University of British Columbia; et al.
2005 Eliciting Design Requirements for Maintenance-Oriented IDEs: A Detailed Study of Corrective and Perf… Andrew Ko, Carnegie Mellon University; et al.
Is Mutation an Appropriate Tool for Testing Experiments? James Andrews, University of Western Ontario; et al.
Using Structural Context to Recommend Source Code Examples Reid Holmes & Gail Murphy, University of British Columbia
Data Structure Repair Using Goal-Directed Reasoning Brian Demsky & Martin Rinard, Massachusetts Institute of Technology
2004 SNIAFL: Towards a Static Non-Interactive Approach to Feature Location Wei Zhao, Peking University; et al.
Extending the REpresentational State Transfer (REST) Architectural Style for Decentralized Systems Rohit Khare & Richard N. Taylor, University of California Irvine
An Empirical Study of Software Reuse vs. Defect-Density and Stability Parastoo Mohagheghi, Ericsson Norway-Grimstad; et al.
A Tool for Writing and Debugging Algebraic Specifications Johannes Henkel & Amer Diwan, University of Colorado
Static Checking of Dynamically Generated Queries in Database Applications Carl Gould, University of California Davis; et al.
2003 Precise Dynamic Slicing Algorithms Xiangyu Zhang, University of Arizona; et al.
Modular Verification of Software Components in C Sagar Chaki, Carnegie Mellon University; et al.
IJCAI (Artificial Intelligence)
2011 Unweighted Coalitional Manipulation Under the Borda Rule is NP-Hard Nadja Betzler, Technische Universität Berlin; et al.
Nested Rollout Policy Adaptation for Monte Carlo Tree Search Christopher D. Rosin, Parity Computing
On the Decidability of Connectedness Constraints in 2D and 3D Euclidean Spaces Roman Kontchakov, Birkbeck College London; et al.
2009 Consequence-Driven Reasoning for Horn SHIQ Ontologies Yevgeny Kazakov, University of Oxford
Learning Conditional Preference Networks with Queries Frederic Koriche, Université Montpellier II
Bruno Zanuttini, Université de Caen Basse-Normandie
2007 Automated Heart Wall Motion Abnormality Detection From Ultrasound Images using Bayesian Networks Maleeha Qazi, Siemens Medical Solutions; et al.
Building Structure into Local Search for SAT Duc Nghia Pham, Griffith University; et al.
Performance Analysis of Online Anticipatory Algorithms for Large Multistage Stochastic Integer Progr… Luc Mercier & Pascal Van Hentenryck, Brown University
2005 Learning Coordination Classifiers Yuhong Guo, University of Alberta; et al.
Solving Checkers Jonathan Schaeffer, University of Alberta; et al.
A Probabilistic Model of Redundancy in Information Extraction Doug Downey, University of Washington; et al.
2003 Approximating Game-Theoretic Optimal Strategies for Full-scale Poker Darse Billings, University of Alberta; et al.
Thin Junction Tree Filters for Simultaneous Localization and Mapping Mark A. Paskin, University of California Berkeley
2001 Complexity Results for Structure-Based Causality Thomas Eiter & Thomas Lukasiewicz, Vienna University of Technology
1999 Learning in Natural Language Dan Roth, University of Illinois at Urbana-Champaign
A Distributed Case-Based Reasoning Application for Engineering Sales Support Ian Watson, University of Salford
Dan Gardingen, Western Air
1997 Object Identification in a Bayesian Context Timothy Huang & Stuart Russell, University of California Berkeley
Translingual Information Retrieval: A Comparative Evaluation Jaime G. Carbonell, Carnegie Mellon University; et al.
Applications of the Situation Calculus to Formalizing Control and Strategic Information: The Prolog … Fangzhen Lin, The Hongkong University of Science and Technology
KDD (Data Mining)
2011 Leakage in Data Mining: Formulation, Detection, and Avoidance Shachar Kaufman, Tel-Aviv University; et al.
2010 Large linear classification when data cannot fit in memory Hsiang-Fu Yu, National Taiwan University; et al.
Connecting the dots between news articles Dafna Shahaf & Carlos Guestrin, Carnegie Mellon University
2009 Collaborative Filtering with Temporal Dynamics Yehuda Koren, Yahoo! Research
2008 Fastanova: an efficient algorithm for genome-wide association study Xiang Zhang, University of North Carolina at Chapel Hill; et al.
2007 Predictive discrete latent factor models for large scale dyadic data Deepak Agarwal & Srujana Merugu, Yahoo! Research
2006 Training linear SVMs in linear time Thorsten Joachims, Cornell University
2005 Graphs over time: densification laws, shrinking diameters and possible explanations Jure Leskovec, Carnegie Mellon University; et al.
2004 A probabilistic framework for semi-supervised clustering Sugato Basu, University of Texas at Austin; et al.
2003 Maximizing the spread of influence through a social network David Kempe, Cornell University; et al.
2002 Pattern discovery in sequences under a Markov assumption Darya Chudova & Padhraic Smyth, University of California Irvine
2001 Robust space transformations for distance-based operations Edwin M. Knorr, University of British Columbia; et al.
2000 Hancock: a language for extracting signatures from data streams Corinna Cortes, AT&T Laboratories; et al.
1999 MetaCost: a general method for making classifiers cost-sensitive Pedro Domingos, Universidade Técnica de Lisboa
1998 Occam’s Two Razors: The Sharp and the Blunt Pedro Domingos, Universidade Técnica de Lisboa
1997 Analysis and Visualization of Classifier Performance: Comparison under Imprecise Class and Cost Dist… Foster Provost & Tom Fawcett, NYNEX Science and Technology
OSDI (Operating Systems)
2010 Efficient System-Enforced Deterministic Parallelism Amittai Aviram, Yale University; et al.
The Turtles Project: Design and Implementation of Nested Virtualization Muli Ben-Yehuda, IBM Research; et al.
2008 KLEE: Unassisted and Automatic Generation of High-Coverage Tests for Complex Systems Programs Cristian Cadar, Stanford University; et al.
Difference Engine: Harnessing Memory Redundancy in Virtual Machines Diwaker Gupta, University of California San Diego; et al.
DryadLINQ: A System for General-Purpose Distributed Data-Parallel Computing Using a High-Level Langu… Yuan Yu, Microsoft Research; et al.
2006 Bigtable: A Distributed Storage System for Structured Data Fay Chang, Google; et al.
Rethink the Sync Edmund B. Nightingale, University of Michigan; et al.
2004 Using Model Checking to Find Serious File System Errors Junfeng Yang, Stanford University; et al.
Recovering Device Drivers Michael M. Swift, University of Washington; et al.
2002 Memory Resource Management in VMware ESX Server Carl A. Waldspurger, VMware
2000 Checking System Rules Using System-Specific, Programmer-Written Compiler Extensions Dawson Engler, Stanford University; et al.
1999 IO-Lite: A Unified I/O Buffering and Caching System Vivek S. Pai, Rice University; et al.
1996 Automatic Compiler-Inserted I/O Prefetching for Out-of-Core Applications Todd C. Mowry, University of Toronto; et al.
Safe Kernel Extensions Without Run-Time Checking George C. Necula & Peter Lee, Carnegie Mellon University
PLDI (Programming Languages)
2011 Data Representation Synthesis Peter Hawkins, Stanford University; et al.
2010 Safe to the Last Instruction: Automated Verification of a Type-Safe Operating System Jean Yang, Massachusetts Institute of Technology
Chris Hawblitzel, Microsoft Research
2009 Binary Analysis for Measurement and Attribution of Program Performance Nathan Tallent, Rice University; et al.
2007 Fault-tolerant Typed Assembly Language Frances Perry, Princeton University; et al.
The Ant and the Grasshopper: Fast and Accurate Pointer Analysis for Millions of Lines of Code Ben Hardekopf & Calvin Lin, University of Texas at Austin
2005 Automatic Pool Allocation: Improving Performance by Controlling Data Structure Layout in the Heap Chris Lattner & Vikram Adve, University of Illinois at Urbana-Champaign
Programming by Sketching for Bit-Streaming Programs Armando Solar-Lezama, University of California Berkeley; et al.
2004 Cloning-Based Context-Sensitive Pointer Alias Analysis Using Binary Decision Diagrams John Whaley & Monica S. Lam, Stanford University
2003 Automatically Proving the Correctness of Compiler Optimizations Sorin Lerner, University of Washington; et al.
2000 Dynamo: a transparent dynamic optimization system Vasanth Bala, Hewlett-Packard Labs; et al.
1999 Whole program paths James R. Larus, Microsoft Research
PODS (Databases)
2011 Data Exchange Beyond Complete Data Marcelo Arenas, Pontificia Universidad Católica de Chile; et al.
2010 An Optimal Algorithm for the Distinct Elements Problem Daniel M. Kane, Harvard University; et al.
2009 Size and Treewidth Bounds for Conjunctive Queries Georg Gottlob, University of Oxford; et al.
2008 Estimating PageRank on Graph Streams Atish Das Sarma, Georgia Institute of Technology; et al.
2007 Generalized Hypertree Decompositions: NP-Hardness and Tractable Variants Georg Gottlob, University of Oxford; et al.
2006 Two-variable logic on data trees and XML reasoning Mikolaj Bojanczyk, Warsaw University; et al.
2005 On the complexity of division and set joins in the relational algebra Dirk Leinders & Jan Van den Bussche, Limburgs Universitair Centrum
XML data exchange: consistency and query answering Marcelo Arenas & Leonid Libkin, University of Toronto
2004 Conditional XPath, the first order complete XPath dialect Maarten Marx, University of Amsterdam
2003 An Information-Theoretic Approach to Normal Forms for Relational and XML Data Marcelo Arenas & Leonid Libkin, University of Toronto
2002 Monadic Datalog and the Expressive Power of Languages for Web Information Extraction Georg Gottlob & Christoph Koch, Technische Universität Wien
2001 Optimal aggregation algorithms for middleware Ronald Fagin, IBM Research; et al.
2000 Auditing Boolean attributes Jon Kleinberg, Cornell University; et al.
1999 Exact and approximate aggregation in constraint query languages Michael Benefikt & Leonid Libkin, Bell Labs
1998 A lower bound theorem for indexing schemes and its application to multidimensional range queries Vasilis Samoladas & Daniel P. Miranker, University of Texas at Austin
Expressiveness of structured document query languages based on attribute grammars Frank Neven & Jan Van den Bussche, Limburgs Universitair Centrum
1997 On the Complexity of Database Queries Christos H. Papadimitriou, University of California Berkeley
Mihalis Yannakakis, Bell Labs
SIGIR (Information Retrieval)
2011 Find It If You Can: A Game for Modeling Different Types of Web Search Success Using Interaction Data Mikhail Ageev, Moscow State University; et al.
2010 Assessing the Scenic Route: Measuring the Value of Search Trails in Web Logs Ryen W. White, Microsoft Research
Jeff Huang, University of Washington
2009 Sources of evidence for vertical selection Jaime Arguello, Carnegie Mellon University; et al.
2008 Algorithmic Mediation for Collaborative Exploratory Search Jeremy Pickens, FX Palo Alto Lab; et al.
2007 Studying the Use of Popular Destinations to Enhance Web Search Interaction Ryen W. White, Microsoft Research; et al.
2006 Minimal Test Collections for Retrieval Evaluation Ben Carterette, University of Massachusetts Amherst; et al.
2005 Learning to estimate query difficulty: including applications to missing content detection and distr… Elad Yom-Tov, IBM Research; et al.
2004 A Formal Study of Information Retrieval Heuristics Hui Fang, University of Illinois at Urbana-Champaign; et al.
2003 Re-examining the potential effectiveness of interactive query expansion Ian Ruthven, University of Strathclyde
2002 Novelty and redundancy detection in adaptive filtering Yi Zhang, Carnegie Mellon University; et al.
2001 Temporal summaries of new topics James Allan, University of Massachusetts Amherst; et al.
2000 IR evaluation methods for retrieving highly relevant documents Kalervo Järvelin & Jaana Kekäläinen, University of Tampere
1999 Cross-language information retrieval based on parallel texts and automatic mining of parallel texts … Jian-Yun Nie, Université de Montréal; et al.
1998 A theory of term weighting based on exploratory data analysis Warren R. Greiff, University of Massachusetts Amherst
1997 Feature selection, perceptron learning, and a usability case study for text categorization Hwee Tou Ng, DSO National Laboratories; et al.
1996 Retrieving spoken documents by combining multiple index sources Gareth Jones, University of Cambridge; et al.
SIGMOD (Databases)
2011 Entangled Queries: Enabling Declarative Data-Driven Coordination Nitin Gupta, Cornell University; et al.
2010 FAST: fast architecture sensitive tree search on modern CPUs and GPUs Changkyu Kim, Intel; et al.
2009 Generating example data for dataflow programs Christopher Olston, Yahoo! Research; et al.
2008 Serializable isolation for snapshot databases Michael J. Cahill, University of Sydney; et al.
2007 Compiling mappings to bridge applications and databases Sergey Melnik, Microsoft Research; et al.
2006 To search or to crawl?: towards a query optimizer for text-centric tasks Panagiotis G. Ipeirotis, New York University; et al.
2004 Indexing spatio-temporal trajectories with Chebyshev polynomials Yuhan Cai & Raymond T. Ng, University of British Columbia
2003 Spreadsheets in RDBMS for OLAP Andrew Witkowski, Oracle; et al.
2001 Locally adaptive dimensionality reduction for indexing large time series databases Eamonn Keogh, University of California Irvine; et al.
2000 XMill: an efficient compressor for XML data Hartmut Liefke, University of Pennsylvania
Dan Suciu, AT&T Laboratories
1999 DynaMat: a dynamic view management system for data warehouses Yannis Kotidis & Nick Roussopoulos, University of Maryland
1998 Efficient transparent application recovery in client-server information systems David Lomet & Gerhard Weikum, Microsoft Research
1997 Fast parallel similarity search in multimedia databases Stefan Berchtold, University of Munich; et al.
1996 Implementing data cubes efficiently Venky Harinarayan, Stanford University; et al.
SOSP (Operating Systems)
2011 A File is Not a File: Understanding the I/O Behavior of Apple Desktop Applications Tyler Harter, University of Wisconsin; et al.
Cells: A Virtual Mobile Smartphone Architecture Jeremy Andrus, Columbia University; et al.
2009 FAWN: A Fast Array of Wimpy Nodes David G. Andersen, Carnegie Mellon University; et al.
seL4: Formal Verification of an OS Kernel Gerwin Klein, NICTA; et al.
RouteBricks: Exploiting Parallelism to Scale Software Routers Mihai Dobrescu, École Polytechnique Fédérale de Lausanne; et al.
2007 Zyzzyva: speculative byzantine fault tolerance Ramakrishna Kotla, University of Texas at Austin; et al.
Sinfonia: a new paradigm for building scalable distributed systems Marcos K. Aguilera, Hewlett-Packard Labs; et al.
Secure Web Applications via Automatic Partitioning Stephen Chong, Cornell University; et al.
2005 Rx: treating bugs as allergies – a safe method to survive software failures Feng Qin, University of Illinois at Urbana-Champaign; et al.
2003 Backtracking intrusions Samuel T. King & Peter M. Chen, University of Michigan
Preserving peer replicas by rate-limited sampled voting Petros Maniatis, Stanford University; et al.
Improving the Reliability of Commodity Operating Systems Michael M. Swift, University of Washington; et al.
2001 BASE: using abstraction to improve fault tolerance Rodrigo Rodrigues, Massachusetts Institute of Technology; et al.
Untrusted hosts and confidentiality: secure program partitioning Steve Zdancewic, Cornell University; et al.
1999 Cellular Disco: resource management using virtual clusters on shared-memory multiprocessors Kinshuk Govil, Stanford University; et al.
Soft timers: efficient microsecond software timer support for network processing Mohit Aron & Peter Druschel, Rice University
The Click modular router Robert Morris, Massachusetts Institute of Technology; et al.
Manageability, availability and performance in Porcupine: a highly scalable, cluster-based mail serv… Yasushi Saito, University of Washington; et al.
1997 Continuous profiling: where have all the cycles gone? Jennifer M. Anderson, Digital Equipment Corporation; et al.
Disco: running commodity operating systems on scalable multiprocessors Edouard Bugnion, Stanford University; et al.
Eraser: a dynamic data race detector for multithreaded programs Stefan Savage, University of Washington; et al.
STOC (Theory)
2011 Electrical flows, laplacian systems, and faster approximation of maximum flow in undirected graphs Paul Christiano, Massachusetts Institute of Technology; et al.
Subexponential lower bounds for randomized pivoting rules for the simplex algorithm Oliver Friedmann, University of Munich; et al.
2010 An improved LP-based approximation for steiner tree Jaroslaw Byrka, École Polytechnique Fédérale de Lausanne; et al.
QIP = PSPACE Rahul Jain, National University of Singapore; et al.
2009 A constructive proof of the Lovász local lemma Robin A. Moser, ETH Zurich
Public-Key Cryptosystems from the Worst-Case Shortest Vector Problem Chris Peikert, SRI International
2008 Optimal algorithms and inapproximability results for every CSP? Prasad Raghavendra, University of Washington
Optimal hierarchical decompositions for congestion minimization in networks Harald Räcke, University of Warwick
2007 Faster integer multiplication Martin Fürer, Pennsylvania State University
Towards 3-query locally decodable codes of subexponential length Sergey Yekhanin, Massachusetts Institute of Technology
2006 The PCP theorem by gap amplification Irit Dinur, Hebrew University
2005 Undirected ST-connectivity in log-space Omer Reingold, Weizmann Institute of Science
2004 Multi-linear formulas for permanent and determinant are of super-polynomial size Ran Raz, Weizmann Institute of Science
Expander flows, geometric embeddings and graph partitioning Sanjeev Arora, Princeton University; et al.
2003 Derandomizing polynomial identity tests means proving circuit lower bounds Valentine Kabanets & Russell Impagliazzo, University of California San Diego
New lattice-based cryptographic constructions Oded Regev, Tel-Aviv University
UIST (User Interface)
2011 SideBySide: Ad-hoc Multi-user Interaction with Handheld Projectors Karl D.D. Willis, Carnegie Mellon University; et al.
2010 VizWiz: nearly real-time answers to visual questions Jeffrey P. Bigham, University of Rochester; et al.
2009 Mouse 2.0: Multi-touch meets the Mouse Nicolas Villar, Microsoft Research; et al.
2008 Bringing Physics to the Surface Andrew D. Wilson, Microsoft Research; et al.
2007 ThinSight: Versatile Multi-touch Sensing for Thin Form-factor Displays Steve Hodges, Microsoft Research; et al.
2006 Reflective Physical Prototyping through Integrated Design, Test, and Analysis Björn Hartmann, Stanford University; et al.
2005 Automation and Customization of Rendered Web Pages Michael Bolin, Massachusetts Institute of Technology; et al.
2004 Multi-Finger Gestural Interaction with 3D Volumetric Displays Tovi Grossman, University of Toronto; et al.
CrossY: A Crossing-Based Drawing Application Georg Apitz & François Guimbretière, University of Maryland
2003 Perceptually-Supported Image Editing of Text and Graphics Eric Saund, Palo Alto Research Center; et al.
2002 Clothing Manipulation Takeo Igarashi, University of Tokyo
John F. Hughes, Brown University
2001 Phidgets: Easy Development of Physical Interfaces through Physical Widgets Saul Greenberg & Chester Fitchett, University of Calgary
2000 Sensing Techniques for Mobile Interaction Ken Hinckley, Microsoft Research; et al.
1996 Indigo: A Local Propagation Algorithm for Inequality Constraints Alan Borning, University of Washington; et al.
VLDB (Databases)
2011 RemusDB: Transparent High-Availability for Database Systems Umar Farooq Minhas, University of Waterloo; et al.
2010 Towards Certain Fixes with Editing Rules and Master Data Shuai Ma, University of Edinburgh; et al.
2009 A Unified Approach to Ranking in Probabilistic Databases Jian Li, University of Maryland; et al.
2008 Finding Frequent Items in Data Streams Graham Cormode & Marios Hadjieleftheriou, AT&T Laboratories
Constrained Physical Design Tuning Nicolas Bruno & Surajit Chaudhuri, Microsoft Research
2007 Scalable Semantic Web Data Management Using Vertical Partitioning Daniel J. Abadi, Massachusetts Institute of Technology; et al.
2006 Trustworthy Keyword Search for Regulatory-Compliant Records Retention Soumyadeb Mitra, University of Illinois at Urbana-Champaign; et al.
2005 Cache-conscious Frequent Pattern Mining on a Modern Processor Amol Ghoting, Ohio State University; et al.
2004 Model-Driven Data Acquisition in Sensor Networks Amol Deshpande, University of California Berkeley; et al.
2001 Weaving Relations for Cache Performance Anastassia Ailamaki, Carnegie Mellon University; et al.
1997 Integrating Reliable Memory in Databases Wee Teck Ng & Peter M. Chen, University of Michigan
WWW (World Wide Web)
2011 Towards a theory model for product search Beibei Li, New York University; et al.
2010 Factorizing personalized Markov chains for next-basket recommendation Steffen Rendle, Osaka University; et al.
2009 Hybrid keyword search auctions Ashish Goel, Stanford University
Kamesh Munagala, Duke University
2008 IRLbot: Scaling to 6 billion pages and beyond Hsin-Tsang Lee, Texas A&M University; et al.
2007 Wherefore art thou r3579x?: anonymized social networks, hidden patterns, and structural steganograph… Lars Backstrom, Cornell University; et al.
2006 Random Sampling from a Search Engine’s Index Ziv Bar-Yossef & Maxim Gurevich, Technion
2005 Three-level caching for efficient query processing in large Web search engines Xiaohui Long & Torsten Suel, Polytechnic University
2004 Automatic detection of fragments in dynamically generated web pages Lakshmish Ramaswamy, Georgia Institute of Technology; et al.
2003 Scaling personalized web search Glen Jeh & Jennifer Widom, Stanford University
SemTag and seeker: bootstrapping the semantic web via automated semantic annotation Stephen Dill, IBM Research; et al.
2002 Abstracting application-level web security David Scott & Richard Sharp, University of Cambridge
2001 Engineering Server Driven Consistency for Large Scale Dynamic Web Services Jian Yin, University of Texas at Austin; et al.
2000 Graph Structure in the Web Andrei Broder, AltaVista; et al.
1999 Focused Crawling: A New Approach to Topic-Specific Web Resource Discovery Soumen Chakrabarti, Indian Institute of Technology; et al.
1998 The Interactive Multimedia Jukebox (IMJ): a new paradigm for the on-demand delivery of audio/video Kevin C. Almeroth, University of California Santa Barbara
Mostafa H. Ammar, Georgia Institute of Technology

4 thoughts on “Best Paper Collection

  1. LexSmarter68e
    Purchasing a used or new car could be a difficult procedure should you not know what you are actually performing. By teaching yourself about automobile purchasing prior to head to the dealership, you possibly can make stuff easier for your self. The following tips will help your upcoming purchasing vacation be more pleasant.

    Always provide a auto mechanic along when looking for a new automobile. Auto dealers are popular for promoting lemons and you do not desire to be their next victim. When you can not have a technician to think about automobiles together with you, at the very least ensure that you have him review your ultimate selection before buying it.

    Know your limitations. Prior to starting buying for your upcoming auto or van, make a decision what you can manage to pay, and follow it. Don’t forget to incorporate interest in your calculations. You are likely to shell out all around 20 percent as a payment in advance at the same time, so be well prepared.

    Before visiting a dealership, know what kind of automobile you would like. Study all of you choices just before shopping in order to evaluate which works best for your budget and family requirements. Shop around to determine how much you must pay for a probable car.

    Prior to signing any deal make time to go through every range, including the small print. If you have nearly anything listed that you simply do not recognize, tend not to sign till you get an respond to that you simply recognize. Unsavory salesmen can make use of a contract to put many costs that were not reviewed.

    Should you keep the previous advice at heart next time which you go purchasing a vehicle, you will end up more likely to get a good deal. Investing in a car does not have to become a headache. Simply use the ideas from this post and you will get the auto you desire at the excellent cost.

  2. Rich

    I see interesting content here. Your site can go viral easily, you need some initial traffic only.
    How to get it? Search for: ricusso’s methods massive

  3. ArethaKevin

    I don’t care about this, now i’m making around 1500£ a month.
    There is tricky way i found on the internet. If you want to learn it too,
    simply type in google: Irahsik’s betting system

  4. Dena

    I read a lot of interesting content here. Probably you
    spend a lot of time writing, i know how to save you a lot of time, there is an online tool
    that creates readable, SEO friendly articles in seconds, just search in google
    – laranitas free content source

Leave a Reply

Your email address will not be published. Required fields are marked *