| The complexity of computing (almost) orthogonal matrices with ε-copies of the Fourier transform | 0 | 0.34 | 2021 |
| A New and Flexible Approach to the Analysis of Paired Comparison Data. | 0 | 0.34 | 2018 |
| Approximate Correlation Clustering Using Same-Cluster Queries. | 0 | 0.34 | 2018 |
| Approximate Clustering with Same-Cluster Queries. | 3 | 0.45 | 2018 |
| Semi-supervised deep learning by metric embedding. | 0 | 0.34 | 2016 |
| Paraunitary matrices, entropy, algebraic condition number and Fourier computation | 0 | 0.34 | 2016 |
| Deep unsupervised learning through spatial contrasting. | 6 | 0.47 | 2016 |
| Tight lower bound instances for k-means++ in two dimensions | 0 | 0.34 | 2016 |
| The Complexity of Computing a Fourier Perturbation. | 0 | 0.34 | 2016 |
| Spatial contrasting for deep unsupervised learning. | 0 | 0.34 | 2016 |
| An Omega((n log n)/R) Lower Bound for Fourier Transform Computation in the R-Well Conditioned Model. | 1 | 0.38 | 2016 |
| Tighter Fourier Transform Lower Bounds | 1 | 0.38 | 2015 |
| Deep metric learning using Triplet network. | 0 | 0.34 | 2015 |
| Iterative and Active Graph Clustering Using Trace Norm Minimization Without Cluster Size Constraints | 2 | 0.36 | 2015 |
| A Tighter Lower Bound For Fourier Transform in the Well Conditioned Model. | 0 | 0.34 | 2014 |
| A Tight Lower Bound Instance for k-means plus plus in Constant Dimension | 3 | 0.47 | 2014 |
| Improved Bounds for Online Learning Over the Permutahedron and Other Ranking Polytopes. | 6 | 0.48 | 2014 |
| Reducing Dueling Bandits to Cardinal Bandits. | 23 | 0.91 | 2014 |
| An n\log n Lower Bound for Fourier Transform Computation in the Well Conditioned Model. | 2 | 0.51 | 2014 |
| Online Ranking: Discrete Choice, Spearman Correlation and Other Feedback. | 1 | 0.39 | 2013 |
| A Lower Bound for Fourier Transform Computation in a Linear Model Over 2x2 Unitary Gates Using Matrix Entropy | 5 | 0.80 | 2013 |
| Breaking the Small Cluster Barrier of Graph Clustering | 15 | 0.79 | 2013 |
| An Almost Optimal Unrestricted Fast Johnson-Lindenstrauss Transform | 55 | 2.11 | 2013 |
| Threading machine generated email | 14 | 0.64 | 2013 |
| Learning and Optimizing with Preferences. | 0 | 0.34 | 2013 |
| Bandit Online Optimization over the Permutahedron. | 2 | 0.38 | 2013 |
| Fast and RIP-Optimal Transforms | 3 | 0.40 | 2013 |
| Active Learning of Custering with Side Information Using $\eps$-Smooth Relative Regret Approximations | 1 | 0.44 | 2012 |
| An active learning algorithm for ranking from pairwise preferences with an almost optimal query complexity | 11 | 0.61 | 2012 |
| Active learning using smooth relative regret approximations with applications | 10 | 0.57 | 2012 |
| A note on: No need to choose: How to get both a PTAS and Sublinear Query Complexity | 2 | 0.37 | 2012 |
| Improved approximation algorithms for bipartite correlation clustering | 10 | 0.54 | 2012 |
| Active Learning Using Smooth Relative Regret Approximations with Applications | 0 | 0.34 | 2012 |
| Fitting Tree Metrics: Hierarchical Clustering and Phylogeny | 19 | 1.65 | 2011 |
| Dense Fast Random Projections and Lean Walsh Transforms | 24 | 1.85 | 2011 |
| A New Active Learning Scheme with Applications to Learning to Rank from Pairwise Preferences | 5 | 0.56 | 2011 |
| Ranking from pairs and triplets: information quality, evaluation methods and query complexity | 12 | 0.77 | 2011 |
| Self-Improving Algorithms | 10 | 0.47 | 2011 |
| Active Learning Ranking from Pairwise Preferences with Almost Optimal Query Complexity. | 23 | 1.00 | 2011 |
| Faster dimension reduction | 33 | 1.12 | 2010 |
| Aggregation of Partial Rankings, p-Ratings and Top-m Lists | 40 | 2.64 | 2010 |
| An Improved Algorithm for Bipartite Correlation Clustering | 2 | 0.39 | 2010 |
| Query Efficient PTAS for Minimum Feedback Arc-Set in Tournaments | 0 | 0.34 | 2010 |
| Preference-based learning to rank | 12 | 0.63 | 2010 |
| Streaming k-means approximation. | 60 | 2.02 | 2009 |
| The Fast Johnson-Lindenstrauss Transform and Approximate Nearest Neighbors | 118 | 5.91 | 2009 |
| A Simple Linear Ranking Algorithm Using Query Dependent Intercept Variables | 1 | 0.37 | 2009 |
| Correlation Clustering Revisited: The "True" Cost of Error Minimization Problems | 11 | 0.74 | 2009 |
| Reconciling Real Scores with Binary Comparisons: A New Logistic Based Model for Ranking | 0 | 0.34 | 2008 |
| Property-Preserving Data Reconstruction | 22 | 0.78 | 2008 |
