| Controlling Attention in a Memory-Augmented Neural Network To Solve Working Memory Tasks. | 0 | 0.34 | 2019 |
| Visually Grounded Video Reasoning in Selective Attention Memory. | 0 | 0.34 | 2019 |
| Learning to Remember, Forget and Ignore using Attention Control in Memory. | 0 | 0.34 | 2018 |
| On transfer learning using a MAC model variant. | 0 | 0.34 | 2018 |
| A note on some inequalities used in channel polarization and polar coding. | 0 | 0.34 | 2018 |
| Using Multi-task and Transfer Learning to Solve Working Memory Tasks | 0 | 0.34 | 2018 |
| Simple Analyses of the Sparse Johnson-Lindenstrauss Transform. | 1 | 0.36 | 2018 |
| Randomized Communication vs. Partition Number. | 0 | 0.34 | 2017 |
| Resource-Efficient Common Randomness and Secret-Key Schemes. | 0 | 0.34 | 2017 |
| A Composition Theorem for Conical Juntas. | 0 | 0.34 | 2016 |
| On Multiplicative Weight Updates for Concave and Submodular Function Maximization | 16 | 0.67 | 2015 |
| Exchangeability and Realizability: De Finetti Theorems on Graphs. | 0 | 0.34 | 2014 |
| On the information complexity of cascaded norms with small domains | 1 | 0.35 | 2013 |
| Optimal Bounds for Johnson-Lindenstrauss Transforms and Streaming Problems with Subconstant Error | 43 | 1.50 | 2013 |
| Inferring connectivity model from meter measurements in distribution networks | 9 | 1.47 | 2013 |
| Online Optimization with Dynamic Temporal Uncertainty: Incorporating Short Term Predictions for Renewable Integration in Intelligent Energy Systems. | 0 | 0.34 | 2013 |
| Optimal allocation of land area for a hybrid solar wind power plant | 0 | 0.34 | 2012 |
| Online optimization for the smart (micro) grid | 19 | 1.25 | 2012 |
| Recovery of a Sparse Integer Solution to an Underdetermined System of Linear Equations | 2 | 0.51 | 2011 |
| Index Coding With Side Information | 145 | 8.65 | 2011 |
| Information complexity: a tutorial | 3 | 0.41 | 2010 |
| Lower bounds for edit distance and product metrics via Poincaré-type inequalities | 9 | 0.53 | 2010 |
| The Data Stream Space Complexity of Cascaded Norms | 28 | 1.01 | 2009 |
| Hellinger Strikes Back: A Note on the Multi-party Information Complexity of AND | 28 | 1.07 | 2009 |
| The One-Way Communication Complexity of Hamming Distance | 29 | 1.11 | 2008 |
| Exponential Separation of Quantum and Classical One-Way Communication Complexity | 34 | 1.92 | 2008 |
| Tight lower bounds for selection in randomly ordered streams | 27 | 1.14 | 2008 |
| Estimating statistical aggregates on probabilistic data streams | 54 | 1.96 | 2007 |
| Efficient aggregation algorithms for probabilistic data | 55 | 1.68 | 2007 |
| Estimating the sortedness of a data stream | 34 | 1.72 | 2007 |
| Lower bounds for randomized read/write stream algorithms | 21 | 0.81 | 2007 |
| OLAP over uncertain and imprecise data. | 0 | 0.34 | 2007 |
| Avatar Information Extraction System | 49 | 2.32 | 2006 |
| Efficient allocation algorithms for OLAP over imprecise data | 24 | 0.96 | 2006 |
| The containment problem for Real conjunctive queries with inequalities | 28 | 1.19 | 2006 |
| OLAP Over Uncertain and Imprecise Data. | 0 | 0.34 | 2005 |
| OLAP Over Uncertain and Imprecise Data | 110 | 4.15 | 2005 |
| An Information Statistics Approach to Data Stream and Communication Complexity | 202 | 7.75 | 2004 |
| Generalized Opinion Pooling. | 3 | 0.41 | 2004 |
| The Sketching Complexity of Pattern Matching | 13 | 1.02 | 2004 |
| Two applications of information complexity | 31 | 1.46 | 2003 |
| Cell-probe lower bounds for the partial match problem | 19 | 1.13 | 2003 |
| Counting Distinct Elements in a Data Stream | 203 | 10.04 | 2002 |
| Information theory methods in communication complexity | 44 | 3.30 | 2002 |
| Approximate counting of inversions in a data stream | 26 | 2.46 | 2002 |
| Using Control Theory to Achieve Service Level Objectives In Performance Management. | 0 | 0.34 | 2001 |
| Online server allocation in a server farm via benefit task systems | 6 | 1.14 | 2001 |
| Recognizing End-User Transactions in Performance Management | 9 | 0.68 | 2000 |
| Analysis of Large-Scale Distributed Information Systems | 0 | 0.34 | 2000 |
| Time-space tradeoffs for branching programs | 45 | 3.20 | 1998 |
