Ravindran Kannan

Publication Activity (10 Years)

Years Active: 1979-2024
Publications (10 Years): 13

Top Topics

Constrained Least Squares

Nearest Neighbor Search

Sample Complexity Bounds

Top Venues

J. Comput. Des. Eng.

Publications

Chiranjib Bhattacharyya, Ravindran Kannan, Amit Kumar
Random Separating Hyperplane Theorem and Learning Polytopes. ICALP (2024)
Chiranjib Bhattacharyya, Ravindran Kannan, Amit Kumar
Random Separating Hyperplane Theorem and Learning Polytopes. CoRR (2023)
Chiranjib Bhattacharyya, Ravindran Kannan, Amit Kumar
How many Clusters? - An algorithmic answer. SODA (2022)
Chiranjib Bhattacharyya, Ravindran Kannan, Amit Kumar
Finding k in Latent k- polytope. ICML (2021)
Ravindran Kannan, Narender Singh, Andrzej Przekwas, Xianlian Zhou, Ross Walenga, Andrew Babiskin
A quasi-3D model of the whole lung: airway extension to the tracheobronchial limit using the constrained constructive optimization and alveolar modeling, using a sac-trumpet model. J. Comput. Des. Eng. 8 (2) (2021)
Chiranjib Bhattacharyya, Ravindran Kannan, Amit Kumar
Algorithms for finding k in k-means. CoRR (2020)
Chiranjib Bhattacharyya, Ravindran Kannan
· nnz(data)) time via Subset Smoothing. SODA (2020)
Chiranjib Bhattacharyya, Ravindran Kannan
Near-optimal sample complexity bounds for learning Latent k-polytopes and applications to Ad-Mixtures. ICML (2020)
Chiranjib Bhattacharyya, Ravindran Kannan
Finding a latent k-simplex in O(k . nnz(data)) time via Subset Smoothing. CoRR (2019)
Ravindran Kannan, Santosh S. Vempala
Randomized algorithms in numerical linear algebra. Acta Numer. 26 (2017)
Ravindran Kannan, Santosh S. Vempala
The Hidden Hubs Problem. COLT (2017)
Ravindran Kannan, Michael W. Mahoney, David P. Woodruff
Recent Advances in Randomized Numerical Linear Algebra (NII Shonan Meeting 2016-10). NII Shonan Meet. Rep. 2016 (2016)
Chiranjib Bhattacharyya, Navin Goyal, Ravindran Kannan, Jagdeep Pani
Non-negative Matrix Factorization under Heavy Noise. ICML (2016)
Trapit Bansal, Chiranjib Bhattacharyya, Ravindran Kannan
A provable SVD-based algorithm for learning topics in dominant admixture corpus. CoRR (2014)
Amirali Abdullah, Alexandr Andoni, Ravindran Kannan, Robert Krauthgamer
Spectral Approaches to Nearest Neighbor Search. FOCS (2014)
Amirali Abdullah, Alexandr Andoni, Ravindran Kannan, Robert Krauthgamer
Spectral Approaches to Nearest Neighbor Search. CoRR (2014)
Ravindran Kannan
14th Knuth prize: call for nominations. SIGACT News 45 (1) (2014)
Trapit Bansal, Chiranjib Bhattacharyya, Ravindran Kannan
A provable SVD-based algorithm for learning topics in dominant admixture corpus. NIPS (2014)
Ravindran Kannan, Santosh S. Vempala
Nimble Algorithms for Cloud Computing CoRR (2013)
Ravindran Kannan, Hariharan Narayanan
Random Walks on Polytopes and an Affine Interior Point Method for Linear Programming. Math. Oper. Res. 37 (1) (2012)
Sanjeev Arora, Rong Ge, Ravindran Kannan, Ankur Moitra
Computing a nonnegative matrix factorization - provably. STOC (2012)
Amit Deshpande, Ravindran Kannan, Nikhil Srivastava
Zero-One Rounding of Singular Vectors. ICALP (1) (2012)
Ravindran Kannan
Spectral methods for matrices and tensors. STOC (2010)
Amit Kumar, Ravindran Kannan
Clustering with Spectral Norm and the k-means Algorithm CoRR (2010)
Ravindran Kannan
Spectral Methods for Matrices and Tensors CoRR (2010)
Amit Kumar, Ravindran Kannan
Clustering with Spectral Norm and the k-Means Algorithm. FOCS (2010)
Ravindran Kannan
A New Probability Inequality Using Typical Moments and Concentration Results. FOCS (2009)
Ravindran Kannan, Hadi Salmasian, Santosh S. Vempala
The Spectral Method for General Mixture Models. SIAM J. Comput. 38 (3) (2008)
Ravindran Kannan, Hadi Salmasian, Santosh S. Vempala
The Spectral Method for General Mixture Models. COLT (2005)
Hadi Salmasian, Ravindran Kannan, Santosh S. Vempala
The Spectral Method for Mixture Models Electron. Colloquium Comput. Complex. (067) (2004)
Avrim Blum, Ravindran Kannan
Learning an Intersection of a Constant Number of Halfspaces over a Uniform Distribution. J. Comput. Syst. Sci. 54 (2) (1997)
Ravindran Kannan, Gary L. Miller, Larry Rudolph
Sublinear Parallel Algorithm for Computing the Greatest Common Divisor of Two Integers. SIAM J. Comput. 16 (1) (1987)
Ravindran Kannan, Richard J. Lipton
Polynomial-time algorithm for the orbit problem. J. ACM 33 (4) (1986)
Ravindran Kannan
Solving Systems of Linear Equations over Polynomials. Theor. Comput. Sci. 39 (1985)
Ravindran Kannan, Gary L. Miller, Larry Rudolph
Sublinear Parallel Algorithm for Computing the Greatest Common Divisor of Two Integers FOCS (1984)
Ravindran Kannan
Towards Separating Nondeterminism from Determinism. Math. Syst. Theory 17 (1) (1984)
Ravindran Kannan, Arjen K. Lenstra, László Lovász
Polynomial Factorization and Nonrandomness of Bits of Algebraic and Some Transcendental Numbers STOC (1984)
Ravindran Kannan
Polynomial-Time Aggregation of Integer Programming Problems J. ACM 30 (1) (1983)
Dirk Hausmann, Ravindran Kannan, Bernhard Korte
Exponential Lower Bounds on a Class of Knapsack Algorithms. Math. Oper. Res. 6 (2) (1981)
Rick Giles, Ravindran Kannan
A characterization of threshold matroids. Discret. Math. 30 (2) (1980)
Ravindran Kannan, Richard J. Lipton
The Orbit Problem is Decidable STOC (1980)
Ravindran Kannan
A Polynomial Algorithm for the Two-Variable Integer Programming Problem. J. ACM 27 (1) (1980)
Ravindran Kannan, Achim Bachem
Polynomial Algorithms for Computing the Smith and Hermite Normal Forms of an Integer Matrix. SIAM J. Comput. 8 (4) (1979)