| Oblivious Data for Fairness with Kernels | 0 | 0.34 | 2021 |
| Clustering piecewise stationary processes. | 0 | 0.34 | 2019 |
| Approximations of the Restless Bandit Problem. | 0 | 0.34 | 2019 |
| Consistent Algorithms for Clustering Time Series. | 0 | 0.34 | 2016 |
| Asymptotically consistent estimation of the number of change points in highly dependent time series. | 4 | 0.47 | 2014 |
| A consistent clustering-based approach to estimating the number of change-points in highly dependent time-series | 0 | 0.34 | 2013 |
| Nonparametric Multiple Change Point Estimation in Highly Dependent Time Series. | 2 | 0.42 | 2013 |
| Multiple Change-Point Estimation in Stationary Ergodic Time-Series | 0 | 0.34 | 2012 |
| Online Clustering of Processes. | 8 | 0.70 | 2012 |
| Locating Changes in Highly Dependent Data with Unknown Number of Change Points. | 6 | 0.58 | 2012 |
| Predictive Dynamic User Interfaces For Interactive Visual Search | 4 | 0.51 | 2006 |
