By Conference: AAAI ACL CIKM ICML IJCAI KDD PODS SIGIR SIGMOD VLDB WWW
This page is designed based on the page curated by Dr. Jeff Huang. This page adds two changes: adding online pdf source instead of google scholar links, and specific focus on Data Science.
From Huang's Page: 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: bestpaper-AT-jeffhuang.com. 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). "Distinguished paper award" and "outstanding paper award" are included but not "best student paper" (e.g. NIPS) or "best 10-year old paper" (e.g. POPL).
Other resources: Security Data Science Papers Github page of Papers We Love Quora on Best CS Papers
| AAAI (Artificial Intelligence) | ||
| 2014 | Recovering from Selection Bias in Causal and Statistical Inference | Elias Bareinboim, University of California Los Angeles; et al. |
| 2013 | HC-Search: Learning Heuristics and Cost Functions for Structured Prediction | Janardhan Rao Doppa, Oregon State University; et al. |
| SMILe: Shuffled Multiple-Instance Learning | Gary Doran & Soumya Ray, Case Western Reserve University | |
| 2012 | Learning SVM Classifiers with Indefinite Kernels | Suicheng Gu & Yuhong Guo, Temple University |
| Document Summarization Based on Data Reconstruction | Zhanying He, Zhejiang University; et al. Chun Chen, Zhejiang University Jiajun Bu, Zhejiang University Can Wang, Zhejiang University Lijan Zhang, Zhejiang University Deng Cai, Zhejiang University Xiaofei He, Zhejiang University | |
| 2011 | Dynamic Resource Allocation in Conservation Planning | Daniel Golovin, California Institute of Technology; et al. Andreas Krause, ETH Zurich Beth Gardner, North Carolina State University Sarah J. Converse, Patuxent Wildlife Research Center Steve Morey, U.S. Fish and Wildlife Service |
| Complexity of and Algorithms for Borda Manipulation | Jessica Davies, University of Toronto; et al. George Katsirelos, Université Paris-Sud Nina Narodytska, University of New South Wales Toby Walsh, NICTA | |
| 2010 | How Incomplete Is Your Semantic Web Reasoner? Systematic Analysis of the Completeness of Query Ans... | Giorgos Stoilos, Oxford University; et al. Bernardo Cuenca Grau, Oxford University Ian Horrocks, Oxford University |
| A Novel Transition Based Encoding Scheme for Planning as Satisfiability | Ruoyun Huang, Washington University in St. Louis; et al. Yixin Chen, Washington University in St. Louis Weixiong Zhang, Washington University in St. Louis | |
| 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. Nathanael Chambers, Stanford University George Ferguson, University of Rochester Lucian Galescu, Institute for Human and Machine Cognition Hyuckchul Jung, Institute for Human and Machine Cognition Mary Swift, University of Rochester William Taysom, Institute for Human and Machine Cognition |
| 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. Noam M. Shazeer, Duke University Michael L. Littman, Duke University Sushant Agarwal, Duke University Catherine M. Cheves, Duke University Joseph Fitzgerald, Duke University Jason Grosland, Duke University Fan Jiang, Duke University Shannon Pollard, Duke University Karl Weinmeister, Duke University |
| 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. Armin B. Cremers, University of Bonn Dieter Fox, University of Bonn Dirk Hähnel, University of Bonn Gerhard Lakemeyer, Aachen University of Technology Dirk Schulz, University of Bonn Walter Steiner, University of Bonn Sebastian Thrun, Carnegie Mellon University | |
| 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 | IJCAI (Artificial Intelligence) |
| 2013 | Bayesian Optimization in High Dimensions via Random Embeddings | Ziyu Wang, University of British Columbia; et al. Masrour Zoghi, University of Amsterdam Frank Hutter, Freiberg University David Matheson, University of British Columbia Nando de Freitas, University of British Columbia |
| Flexibility and Decoupling in the Simple Temporal Problem | Michel Wilson, Delft University of Technology; et al. Tomas Klos, Delft University of Technology Cees Witteveen, Delft University of Technology Bob Huisman, Delft University of Technology | |
| 2011 | Unweighted Coalitional Manipulation Under the Borda Rule is NP-Hard | Nadja Betzler, Technische Universität Berlin; et al. Rolf Niedermeier, Technische Universität Berlin Gerhard J. Woeginger, Technische Universität Eindhoven |
| 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. Yavor Nenov, University of Manchester Ian Pratt-Hartmann, University of Manchester Michael Zakharyaschev, Birkbeck College London | |
| 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. Glenn Fung, Siemens Medical Solutions Sriram Krishnan, Siemens Medical Solutions Romer Rosales, Siemens Medical Solutions Harald Steck, Siemens Medical Solutions R. Bharat Rao, Siemens Medical Solutions Don Polderman, Erasmus University Medical Center Dhanalakshmi Chandrasekaran, No Affiliation |
| Building Structure into Local Search for SAT | Duc Nghia Pham, Griffith University; et al. John Thornton, Griffith University Abdul Sattar, Griffith University | |
| Performance Analysis of Online Anticipatory Algorithms for Large Multistage Stochastic Integer Pro... | Luc Mercier & Pascal Van Hentenryck, Brown University | |
| 2005 | Learning Coordination Classifiers | Yuhong Guo, University of Alberta; et al. Russell Greiner, University of Alberta Dale Schuurmans, University of Alberta |
| Solving Checkers | Jonathan Schaeffer, University of Alberta; et al. Yngvi Bjornsson, University of Alberta Neil Burch, University of Alberta Akihiro Kishimoto, University of Alberta Martin Muller, University of Alberta Robert Lake, University of Alberta Paul Lu, University of Alberta Steve Sutphen, University of Alberta | |
| A Probabilistic Model of Redundancy in Information Extraction | Doug Downey, University of Washington; et al. Oren Etzioni, University of Washington Stephen Soderland, University of Washington | |
| 2003 | Approximating Game-Theoretic Optimal Strategies for Full-scale Poker | Darse Billings, University of Alberta; et al. Neil Burch, University of Alberta Aaron Davidson, University of Alberta Robert Holte, University of Alberta Jonathan Schaeffer, University of Alberta Terence Schauenberg, University of Alberta Duane Szafron, University of Alberta |
| 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. Yiming Yang, Carnegie Mellon University Robert E. Frederking, Carnegie Mellon University Ralf D. Brown, Carnegie Mellon University Yibing Geng, Carnegie Mellon University Danny Lee, Carnegie Mellon University | |
| Applications of the Situation Calculus to Formalizing Control and Strategic Information: The Prolo... | Fangzhen Lin, The Hongkong University of Science and Technology | ACL (Natural Language Processing) |
| 2014 | Fast and Robust Neural Network Joint Models for Statistical Machine Translation | Jacob Devlin, Raytheon BBN Technologies; et al. Rabih Zbib, Raytheon BBN Technologies Zhongqiang Huang, Raytheon BBN Technologies Thomas Lamar, Raytheon BBN Technologies Richard Schwartz, Raytheon BBN Technologies John Makhoul, Raytheon BBN Technologies |
| 2013 | Grounded Language Learning from Video Described with Sentences | Haonan Yu & Jeffrey Mark Siskind, Purdue University |
| 2012 | String Re-writing Kernel | Fan Bu, Tsinghua University; et al. |
| Bayesian Symbol-Refined Tree Substitution Grammars for Syntactic Parsing | Hiroyuki Shindo, NTT Communication Science Laboratories; et al. Yusuke Miyao, National Institute of Informatics Akinori Fujino, NTT Communication Science Laboratories Masaaki Nagata, NTT Communication Science Laboratories | |
| 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. Harr Chen, Massachusetts Institute of Technology Luke S. Zettlemoyer, Massachusetts Institute of Technology Regina Barzilay, Massachusetts Institute of Technology |
| 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. Jinxi Xu, BBN Technologies Ralph Weischedel, BBN Technologies | |
| 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. Rob Koeling, University of Sussex Julie Weeds, University of Sussex John Carroll, University of Sussex |
| 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. Gabe Reinstein, Massachusetts Institute of Technology Tom Stocky, Massachusetts Institute of Technology Justine Cassell, Massachusetts Institute of Technology | |
| 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. Michael Jahr, Stanford University
Kevin Knight, University of Southern California Daniel Marcu, University of Southern California Kenji Yamada, University of Southern California |
ICML (Machine Learning) |
| 2014 | Understanding the Limiting Factors of Topic Modeling via Posterior Contraction Analysis | Jian Tang, Peking University; et al. Zhaoshi Meng, University of Michigan XuanLong Nguyen, University of Michigan Qiaozhu Mei, University of Michigan Ming Zhang, Peking University |
| 2013 | Vanishing Component Analysis | Roi Livni, The Hebrew University of Jerusalum; et al. David Lehavi, Hewlett-Packard Labs Sagi Schein, Hewlett-Packard Labs Hila Nachlieli, Hewlett-Packard Labs Shai Shalev Shwartz, The Hebrew University of Jerusalum Amir Globerson, The Hebrew University of Jerusalum |
| Fast Semidifferential-based Submodular Function Optimization | Rishabh Iyer, University of Washington; et al. | |
| 2012 | Bayesian Posterior Sampling via Stochastic Gradient Fisher Scoring | Sungjin Ahn, University of California Irvine; et al. |
| 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. Byron Boots, Carnegie Mellon University Sajid M. Siddiqi, Google Geoffrey Gordon, Carnegie Mellon University Alex Smola, Yahoo! Research |
| 2009 | Structure preserving embedding | Blake Shaw & Tony Jebara, Columbia University |
| 2008 | SVM Optimization: Inverse Dependence on Training Set Size | Shai Shalev-Shwartz & Nathan Srebro, Toyota Technological Institute at Chicago |
| 2007 | Information-theoretic metric learning | Jason V. Davis, University of Texas at Austin; et al. Brian Kulis, University of Texas at Austin Prateek Jain, University of Texas at Austin Suvrit Sra, University of Texas at Austin Inderjit S. Dhillon, University of Texas at Austin |
| 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 | SIGIR (Information Retrieval) |
| 2014 | Partitioned Elias-Fano Indexes | Giuseppe Ottaviano, Istituto di Scienza e Tecnologie dell'Informazione Rossano Venturini, Università di Pisa |
| 2013 | Beliefs and Biases in Web Search | Ryen W. White, Microsoft Research |
| 2012 | Time-Based Calibration of Effectiveness Measures | Mark Smucker & Charles Clarke, University of Waterloo |
| 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. Fernando Diaz, Yahoo! Research Jamie Callan, Carnegie Mellon University Jean-Francois Crespo, Yahoo! Research |
| 2008 | Algorithmic Mediation for Collaborative Exploratory Search | Jeremy Pickens, FX Palo Alto Lab; et al. Gene Golovchinsky, FX Palo Alto Lab Chirag Shah, University of North Carolina at Chapel Hill Pernilla Qvarfordt, FX Palo Alto Lab Maribeth Back, FX Palo Alto Lab |
| 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. James Allan, University of Massachusetts Amherst Ramesh Sitaraman, University of Massachusetts Amherst |
| 2005 | Learning to estimate query difficulty: including applications to missing content detection and dis... | 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. Tao Tao, University of Illinois at Urbana-Champaign ChengXiang Zhai, University of Illinois at Urbana-Champaign |
| 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. Rahul Gupta, University of Massachusetts Amherst Vikas Khandelwal, University of Massachusetts Amherst |
| 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 text... | Jian-Yun Nie, Université de Montréal; et al. Michel Simard, Université de Montréal Pierre Isabelle, Université de Montréal Richard Durand, Université de Montré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. Wei Boon Goh, Ministry of Defence Kok Leong Low, Ministry of Defence |
| 1996 | Retrieving spoken documents by combining multiple index sources | Gareth Jones, University of Cambridge; et al. Jonathan Foote, University of Cambridge
Karen Spärck Jones, University of Cambridge Steve Young, University of Cambridge |
CIKM (Knowledge Management) |
| 2014 | Cross-Device Search | George Montanez, Carnegie Mellon University; et al. Ryen White, Microsoft Research Xiao Huang, Microsoft |
| 2013 | Penguins in Sweaters, or Serendipitous Entity Search on User-generated Content | Ilaria Bordino, Yahoo! Research; et al. |
| 2012 | Gelling, and Melting, Large Graphs by Edge Manipulation | Hanghang Tong, IBM Research; et al. B. Aditya Prakash, Virginia Tech Tina Eliassi-Rad, Rutgers University Michalis Faloutsos, University of California Riverside Christos Faloutsos, Carnegie Mellon University |
| 2011 | Intent-aware query similarity | Jiafeng Guo, Chinese Academy of Sciences; et al. Xueqi Cheng, Chinese Academy of Sciences Gu Su, Microsoft Research Xiaofei Zhu, Chinese Academy of Sciences |
| 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. Vagelis Hristidis, Florida International University Michalis Petropoulos, State University of New York at Buffalo | |
| 2009 | On the Feasibility of Multi-Site Web Search Engines | Ricardo Baeza-Yates, Yahoo! Research; et al. Aristides Gionis, Yahoo! Research Flavio Junqueira, Yahoo! Research Vassilis Plachouras, Yahoo! Research Luca Telloli, Yahoo! Research |
| 2008 | Learning to Link with Wikipedia | David Milne & Ian H. Witten, University 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. Matthias Bender, Max Planck Institut Nikos Ntarmos, RACTI and University of Patras Peter Triantafillou, RACTI and University of Patras Gerhard Weikum, Max Planck Institut Christian Zimmer, Max Planck Institut |
| 2005 | Towards Automatic Association of Relevant Unstructured Content with Structured Query Results | Prasan Roy, IBM Research; et al. Mukesh Mohania, IBM Research Bhuvan Bamba, Georgia Institute of Technology Shree Raman, University of Massachusetts Amherst |
| 2004 | Discovering Frequently Changing Structures from Historical Structural Deltas of Unordered XML | Qiankun Zhao, Nanyang Technological University; et al. Sourav S Bhowmick, Nanyang Technological University
Mukesh Mohania, IBM Research Yahiko Kambayashi, Kyoto University |
KDD (Data Mining) |
| 2014 | Reducing the Sampling Complexity of Topic Models | Aaron Li, Carnegie Mellon University; et al. |
| 2013 | Simple and Deterministic Matrix Sketching | Edo Liberty, Yahoo! Research |
| 2012 | Searching and Mining Trillions of Time Series Subsequences under Dynamic Time Warping | Thanawin Rakthanmanon, University of California Riverside; et al. Bilson Campana, University of California Riverside Abdullah Mueen, University of California Riverside Gustavo Batista, University of São Paulo Brandon Westover, Brigham and Women's Hospital Qiang Zhu, University of California Riverside Jesin Zakaria, University of California Riverside Eamonn Keogh, University of California Riverside |
| 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. Cho-Jui Hsieh, National Taiwan University Kai-Wei Chang, National Taiwan University Chih-Jen Lin, National Taiwan University |
| 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. Mikhail Bilenko, University of Texas at Austin Raymond J. Mooney, University of Texas at Austin |
| 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. Raymond T. Ng, University of British Columbia Ruben H. Zamar, University of British Columbia |
| 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 Di... | Foster Provost & Tom Fawcett, NYNEX Science and Technology | PODS (Databases) |
| 2014 | Weaker Forms of Monotonicity for Declarative Networking: A More Fine-Grained Answer to the CALM-Co... | Tom J. Ameloot, Hasselt University; et al. Bas Ketsman, Hasselt University Frank Neven, Hasselt University Daniel Zinn, LogicBlox |
| 2013 | Verification of database-driven systems via amalgamation | Mikołaj Bojańczyk, University of Warsaw; et al. Luc Segoufin, INRIA Szymon Toruńczyk, University of Warsaw |
| 2012 | Worst-case Optimal Join Algorithms | Hung Q. Ngo, University at Buffalo; et al. Ely Porat, Bar-Ilan University Christopher Ré, University of Wisconsin Atri Rudra, University at Buffalo |
| 2011 | Data Exchange Beyond Complete Data | Marcelo Arenas, Pontificia Universidad Católica de Chile; et al. Jorge Pérez, Universidad de Chile Juan Reutter, University of Edinburgh |
| 2010 | An Optimal Algorithm for the Distinct Elements Problem | Daniel M. Kane, Harvard University; et al. Jelani Nelson, Massachusetts Institute of Technology David P. Woodruff, IBM Research |
| 2009 | Size and Treewidth Bounds for Conjunctive Queries | Georg Gottlob, University of Oxford; et al. Stephanie Lee, University of Oxford Gregory Valient, University of California Berkeley |
| 2008 | Estimating PageRank on Graph Streams | Atish Das Sarma, Georgia Institute of Technology; et al. Sreenivas Gollapudi, Microsoft Research Rina Panigrahy, Microsoft Research |
| 2007 | Generalized Hypertree Decompositions: NP-Hardness and Tractable Variants | Georg Gottlob, University of Oxford; et al. Zoltan Miklos, University of Oxford Thomas Schwentick, Universität Dortmund |
| 2006 | Two-variable logic on data trees and XML reasoning | Mikolaj Bojanczyk, Warsaw University; et al. Claire David, Université Paris Anca Muscholl, Université Paris Thomas Schwentick, Universität Dortmund Luc Segoufin, Université Paris |
| 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. Amnon Lotem, University of Maryland Moni Naor, Weizmann Institute of Science |
| 2000 | Auditing Boolean attributes | Jon Kleinberg, Cornell University; et al. Christos Papadimitriou, University of California Berkeley Prabhakar Raghavan, IBM Research |
| 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 |
SIGMOD (Databases) |
| 2014 | Materialization Optimizations for Feature Selection Workloads | Ce Zhang, Stanford University; et al. Arun Kumar, University of Wisconsin Christopher Ré, Stanford University |
| 2013 | Massive Graph Triangulation | Xiaocheng Hu, The Chinese University of Hong Kong; et al. Yufei Tao, The Chinese University of Hong Kong Chin-Wan Chung, KAIST |
| 2012 | High-Performance Complex Event Processing over XML Streams | Barzan Mozafari, Massachusetts Institute of Technology; et al. Kai Zeng, University of California Los Angeles Carlo Zaniolo, University of California Los Angeles |
| 2011 | Entangled Queries: Enabling Declarative Data-Driven Coordination | Nitin Gupta, Cornell University; et al. Lucja Kot, Cornell University Sudip Roy, Cornell University Gabriel Bender, Cornell University Johannes Gehrke, Cornell University Christoph Koch, École Polytechnique Fédérale de Lausanne |
| 2010 | FAST: fast architecture sensitive tree search on modern CPUs and GPUs | Changkyu Kim, Intel; et al. Jatin Chhugani, Intel Nadathur Satish, Intel Eric Sedlar, Oracle Anthony D. Nguyen, Intel Tim Kaldewey, Oracle Victor W. Lee, Intel Scott A. Brandt, University of California Santa Cruz Pradeep Dubey, Intel |
| 2009 | Generating example data for dataflow programs | Christopher Olston, Yahoo! Research; et al. Shubham Chopra, Yahoo! Research Utkarsh Srivastava, Yahoo! Research |
| 2008 | Serializable isolation for snapshot databases | Michael J. Cahill, University of Sydney; et al. Uwe Röhm, University of Sydney Alan D. Fekete, University of Sydney |
| Scalable Network Distance Browsing in Spatial Databases | Hanan Samet, University of Maryland; et al. Jagan Sankaranarayanan, University of Maryland Houman Alborzi, University of Maryland | |
| 2007 | Compiling mappings to bridge applications and databases | Sergey Melnik, Microsoft Research; et al. Atul Adya, Microsoft Philip A. Bernstein, Microsoft Research |
| Scalable Approximate Query Processing with the DBO Engine | Christopher Jermaine, University of Florida; et al. Subramanian Arumugam, University of Florida Abhijit Pol, University of Florida Alin Dobra, University of Florida | |
| 2006 | To search or to crawl?: towards a query optimizer for text-centric tasks | Panagiotis G. Ipeirotis, New York University; et al. Eugene Agichtein, Microsoft Research Pranay Jain, Columbia University Luis Gravano, Columbia University |
| 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. Srikanth Bellakonda, Oracle Tolga Bozkaya, Oracle Gregory Dorman, Oracle Nathan Folkert, Oracle Abhinav Gupta, Oracle Lei Shen, Oracle Sankar Subramanian, Oracle |
| 2001 | Locally adaptive dimensionality reduction for indexing large time series databases | Eamonn Keogh, University of California Irvine; et al. Kaushik Chakrabarti, University of California Irvine Michael Pazzani, University of California Irvine Sharad Mehrotra, University of California Irvine |
| 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 |
| Integrating association rule mining with relational database systems: alternatives and implications | Sunita Sarawagi, IBM Research; et al. Shiby Thomas, University of Florida Rakesh Agrawal, IBM Research | |
| 1997 | Fast parallel similarity search in multimedia databases | Stefan Berchtold, University of Munich; et al. Christian Böml, University of Munich Bernhard Braunmüller, University of Munich Daniel A. Keim, University of Munich Hans-Peter Kriegel, University of Munich |
| 1996 | Implementing data cubes efficiently | Venky Harinarayan, Stanford University; et al. Anand Rajaraman, Stanford University
Jeffrey D. Ullman, Stanford University |
VLDB (Databases) |
| 2014 | M4: A Visualization-Oriented Time Series Data Aggregation | Uwe Jugel, SAP; et al. Zbigniew Jerzak, SAP Gregor Hackenbroich, SAP Volker Markl, Technische Universität Berlin |
| Building Efficient Query Engines in a High-Level Language | Yannis Klonatos, École Polytechnique Fédérale de Lausanne; et al. Christoph Koch, École Polytechnique Fédérale de Lausanne Tiark Rompf, École Polytechnique Fédérale de Lausanne Hassan Chaf, Oracle | |
| On k-Path Covers and their Applications | Stefan Funke, University of Stuttgart; et al. André Nusser, University of Stuttgart Sabine Storandt, University of Stuttgart | |
| epiC: an Extensible and Scalable System for Processing Big Data | Dawei Jiang, National University of Singapore; et al. Gang Chen, Zhejiang University Beng Chin Ooi, National University of Singapore Kian-Lee Tan, National University of Singapore Sai Wu, Zhejiang University | |
| The Uncracked Pieces in Database Cracking | Felix Martin Schuhknecht, Saarland University; et al. Alekh Jindal, Massachusetts Institute of Technology Jens Dittrich, Saarland University | |
| 2013 | DisC Diversity: Result Diversification based on Dissimilarity and Coverage | Marina Drosou & Evaggelia Pitoura, University of Ioannina |
| 2012 | Dense Subgraph Maintenance under Streaming Edge Weight Updates for Real-time Story Identification | Albert Angel, University of Toronto; et al. Nick Koudas, University of Toronto Nikos Sarkas, University of Toronto Divesh Srivastava, AT&T Laboratories |
| 2011 | RemusDB: Transparent High-Availability for Database Systems | Umar Farooq Minhas, University of Waterloo; et al. Shriram Rajagopalan, University of British Columbia Brendan Cully, University of British Columbia Ashraf Aboulnaga, University of Waterloo Ken Salem, University of Waterloo Andrew Warfield, University of British Columbia |
| 2010 | Towards Certain Fixes with Editing Rules and Master Data | Shuai Ma, University of Edinburgh; et al. Wenfei Fan, University of Edinburgh Jianzhong Li, Harbin Institute of Technology Wenyuan Yu, University of Edinburgh Nan Tang, University of Edinburgh |
| 2009 | A Unified Approach to Ranking in Probabilistic Databases | Jian Li, University of Maryland; et al. Barna Saha, University of Maryland Amol Deshpande, University of Maryland |
| 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. Adam Marcus, Massachusetts Institute of Technology Samuel R. Madden, Massachusetts Institute of Technology Kate Hollenbach, Massachusetts Institute of Technology |
| 2006 | Trustworthy Keyword Search for Regulatory-Compliant Records Retention | Soumyadeb Mitra, University of Illinois at Urbana-Champaign; et al. Windsor W. Hsu, University of Illinois at Urbana-Champaign Marianne Winslett, University of Illinois at Urbana-Champaign |
| 2005 | Cache-conscious Frequent Pattern Mining on a Modern Processor | Amol Ghoting, Ohio State University; et al. Gregory Buehrer, Ohio State University Srinivasan Parthasarathy, Ohio State University Daehyun Kim, Intel Anthony D. Nguyen, Intel Yen-Kuang Chen, Intel Pradeep Dubey, Intel |
| 2004 | Model-Driven Data Acquisition in Sensor Networks | Amol Deshpande, University of California Berkeley; et al. Carlos Guestrin, Intel Research Samuel R. Madden, Massachusetts Institute of Technology Joseph M. Hellerstein, University of California Berkeley Wei Hong, Intel Research |
| 2001 | Weaving Relations for Cache Performance | Anastassia Ailamaki, Carnegie Mellon University; et al. David J. DeWitt, University of Wisconsin Mark D. Hill, University of Wisconsin Marios Skounakis, University of Wisconsin |
| 1997 | Integrating Reliable Memory in Databases | Wee Teck Ng & Peter M. Chen, University of Michigan | WWW (World Wide Web) |
| 2014 | Efficient Estimation for High Similarities using Odd Sketches | Michael Mitzenmacher, Harvard University; et al. |
| 2013 | No Country for Old Members: User Lifecycle and Linguistic Change in Online Communities | Cristian Danescu-Niculescu-Mizil, Stanford University; et al. Robert West, Stanford University Dan Jurafsky, Stanford University Jure Leskovec, Stanford University Christopher Potts, Stanford University |
| 2012 | Counting Beyond a Yottabyte, or how SPARQL 1.1 Property Paths will Prevent Adoption of the Standard | Marcelo Arenas, Pontificia Universidad Católica de Chile; et al. Sebastián Conca, Pontificia Universidad Católica de Chile Jorge Pérez, Universidad de Chile |
| 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. Derek Leonard, Texas A&M University Xiaoming Wang, Texas A&M University Dmitri Loguinov, Texas A&M University |
| 2007 | Wherefore art thou r3579x?: anonymized social networks, hidden patterns, and structural steganogra... | 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 Institute of New York 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. Nadav Eiron, IBM Research David Gibson, IBM Research Daniel Gruhl, IBM Research R. Guha, IBM Research Anant Jhingran, IBM Research Tapas Kanungo, IBM Research Sridhar Rajagopalan, IBM Research Andrew Tomkins, IBM Research John A. Tomlin, IBM Research Jason Y. Zien, IBM Research | |
| 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. Lorenzo Alvisi, University of Texas at Austin Mike Dahlin, University of Texas at Austin Arun Iyengar, IBM Research |
| 2000 | Graph Structure in the Web | Andrei Broder, AltaVista; et al. Ravi Kumar, IBM Research Farzin Maghoul, AltaVista Prabhakar Raghavan, IBM Research Sridhar Rajagopalan, IBM Research Raymie Stata, Compaq Systems Research Center Andrew Tomkins, IBM Research Janet Wiener, Compaq Systems Research Center |
| 1999 | Focused Crawling: A New Approach to Topic-Specific Web Resource Discovery | Soumen Chakrabarti, Indian Institute of Technology; et al. Martin van den Berg, FX Palo Alto Lab Byron Dom, IBM Research |
| 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 |
Rexford's Favorite Papers |
| 2008 | My Ten Favorite “Practical Theory” Papers | Jennifer Rexford, Princeton University |
| 2002 | The Stable Paths Problem and Interdomain Routing | Timothy G. Griffin, University of Cambridge; et al. |
| 2007 | Layering as optimization decomposition: A mathematical theory of network architectures | Mung Chiang, Princeton University; et al. |
| 2001 | Trajectory Sampling for Direct Traffic Observation | N. Duffield, Texas A&M University; et al. Matthias Grossglauser, EPFL |
| 2003 | Fast accurate computation of large-scale IP traffic matrices from link loads | Yin Zhang, UT ; et al. |
| 2003 | Automatically inferring patterns of resource consumption in network traffic | Cristian Estan, Texas A&M University; et al. |
| 2004 | Network applications of Bloom filters: A survey | Andrei Broder, Google; et al. Michael Mitzenmacher, Harvard University |
| 1993 | A generalized processor sharing approach to flow control in integrated services networks: The single-node ... | Abhay Parekh, U C Berkeley; et al. R. Gallagher, UC San Diego |
| 2003 | Supporting stored video: Reducing rate variability and end-to-end re- source requirements through optimal smoothing | James D. Salehi, U Mass; et al. |
| 2003 | Exploiting process lifetime distributions for dynamic load balancing | Mor Harchol-Balter , U C Berkeley; et al. Allen Downey, U C Berkeley |
| 2003 | The power of two random choices: A survey of techniques and results | Michael Mitzenmacher, Texas A&M University; et al. R. Sitaraman, U Mass |