| Tiered Sampling: An Efficient Method for Counting Sparse Motifs in Massive Graph Streams | 0 | 0.34 | 2021 |
| Semi-Supervised Aggregation Of Dependent Weak Supervision Sources With Performance Guarantees | 0 | 0.34 | 2021 |
| Fast Doubly-Adaptive MCMC to Estimate the Gibbs Partition Function with Weak Mixing Time Bounds. | 0 | 0.34 | 2021 |
| Distributed Graph Diameter Approximation | 0 | 0.34 | 2020 |
| Learning Equilibria of Simulation-Based Games. | 0 | 0.34 | 2019 |
| Learning Simulation-Based Games from Data | 0 | 0.34 | 2019 |
| Ordalia: Deep Learning Hyperparameter Search via Generalization Error Bounds Extrapolation | 0 | 0.34 | 2019 |
| Wikipedia Polarization And Its Effects On Navigation Paths | 0 | 0.34 | 2019 |
| Towards Interactive Curation & Automatic Tuning of ML Pipelines | 0 | 0.34 | 2018 |
| Efficient Approximation for Restricted Biclique Cover Problems. | 0 | 0.34 | 2018 |
| VizRec: A framework for secure data exploration via visual representation. | 0 | 0.34 | 2018 |
| Differentially Mutated Subnetworks Discovery. | 0 | 0.34 | 2018 |
| Uniform Convergence Bounds for Codec Selection. | 0 | 0.34 | 2018 |
| Tiered sampling: An efficient method for approximate counting sparse motifs in massive graph streams | 0 | 0.34 | 2017 |
| Scalable and Provably Secure P2P Communication Protocols. | 0 | 0.34 | 2017 |
| Controlling False Discoveries During Interactive Data Exploration. | 3 | 0.41 | 2017 |
| The k-Nearest Representatives Classifier: A Distance-Based Classifier with Strong Generalization Bounds | 0 | 0.34 | 2017 |
| MapReduce and Streaming Algorithms for Diversity Maximization in Metric Spaces of Bounded Doubling Dimension. | 4 | 0.40 | 2017 |
| MapReduce and Streaming Algorithms for Diversity Maximization in Metric Spaces of Bounded Doubling Dimension. | 0 | 0.34 | 2017 |
| Towards Interactive Data Exploration. | 0 | 0.34 | 2017 |
| Minimizing Operational Cost For Zero Information Leakage | 0 | 0.34 | 2017 |
| Reconstructing Hidden Permutations Using the Average-Precision (AP) Correlation Statistic. | 1 | 0.38 | 2016 |
| TRIÈST: Counting Local and Global Triangles in Fully-dynamic Streams with Fixed Memory Size. | 27 | 0.82 | 2016 |
| Balanced Allocation: Patience is not a Virtue. | 0 | 0.34 | 2016 |
| ABRA: Approximating Betweenness Centrality in Static and Dynamic Graphs with Rademacher Averages. | 7 | 0.51 | 2016 |
| Wiggins: Detecting Valuable Information in Dynamic Networks Using Limited Resources. | 2 | 0.37 | 2016 |
| Novel inexact memory aware algorithm co-design for energy efficient computation: algorithmic principles | 1 | 0.35 | 2015 |
| Mining Frequent Itemsets through Progressive Sampling with Rademacher Averages | 14 | 0.57 | 2015 |
| Enabling Robust and Efficient Distributed Computation in Dynamic Peer-to-Peer Networks | 8 | 0.47 | 2015 |
| Space and Time Efficient Parallel Graph Decomposition, Clustering, and Diameter Approximation | 6 | 0.47 | 2015 |
| Parallel Graph Decomposition and Diameter Approximation in o(Diameter) Time and Linear Space. | 0 | 0.34 | 2014 |
| A Clustering Approach to Solving Large Stochastic Matching Problems | 3 | 0.43 | 2013 |
| PageRank on an evolving graph | 29 | 1.03 | 2012 |
| Learning-based Query Performance Modeling and Prediction | 63 | 2.01 | 2012 |
| Workshop: Algorithms for discovery of mutated pathways in cancer | 0 | 0.34 | 2012 |
| Fast distributed PageRank computation. | 14 | 0.90 | 2012 |
| PARMA: a parallel randomized algorithm for approximate association rules mining in MapReduce | 52 | 1.55 | 2012 |
| Performance prediction for concurrent database workloads | 70 | 2.31 | 2011 |
| The VC-Dimension of Queries and Selectivity Estimation Through Sampling | 2 | 0.37 | 2011 |
| MADMX: a strategy for maximal dense motif extraction. | 8 | 0.47 | 2011 |
| The Case for Predictive Database Systems: Opportunities and Challenges | 24 | 1.12 | 2011 |
| Efficient Discovery of Association Rules and Frequent Itemsets through Sampling with Tight Performance Guarantees | 11 | 0.60 | 2011 |
| Sorting and selection on dynamic data | 3 | 0.55 | 2011 |
| De novo discovery of mutated driver pathways in cancer. | 40 | 3.74 | 2011 |
| Algorithms for detecting significantly mutated pathways in cancer. | 46 | 2.39 | 2011 |
| Infectious Random Walks | 4 | 0.44 | 2010 |
| Database-support for Continuous Prediction Queries over Streaming Data. | 0 | 0.34 | 2010 |
| Database-support for continuous prediction queries over streaming data | 7 | 0.59 | 2010 |
| The Hiring Problem and Lake Wobegon Strategies | 12 | 1.66 | 2009 |
| MADMX: a novel strategy for maximal dense motif extraction | 3 | 0.41 | 2009 |
