Ravindran Kannan - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 33 from 33

2022

How many Clusters? - An algorithmic answerChiranjib Bhattacharyya, Ravindran Kannan, Amit Kumar 0001. soda 2022: 2607-2640 [doi]

2021

Finding k in Latent k- polytopeChiranjib Bhattacharyya, Ravindran Kannan, Amit Kumar 0001. icml 2021: 894-903 [doi]

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 modelRavindran Kannan, Narender Singh, Andrzej Przekwas, Xianlian Zhou, Ross Walenga, Andrew Babiskin. jcde, 8(2):691-704, 2021. [doi]

2020

Near-optimal sample complexity bounds for learning Latent k-polytopes and applications to Ad-MixturesChiranjib Bhattacharyya, Ravindran Kannan. icml 2020: 854-863 [doi]

k · nnz(data)) time via Subset SmoothingChiranjib Bhattacharyya, Ravindran Kannan. soda 2020: 122-140 [doi]

2017

The Hidden Hubs ProblemRavindran Kannan, Santosh Vempala. colt 2017: 1190-1213 [doi]

Randomized algorithms in numerical linear algebraRavindran Kannan, Santosh S. Vempala. actanum, 26:95-135, 2017. [doi]

2016

Non-negative Matrix Factorization under Heavy NoiseChiranjib Bhattacharyya, Navin Goyal, Ravindran Kannan, Jagdeep Pani. icml 2016: 1426-1434 [doi]

Recent Advances in Randomized Numerical Linear Algebra (NII Shonan Meeting 2016-10)Ravindran Kannan, Michael W. Mahoney, David P. Woodruff. shonan-reports, 2016, 2016. [doi]

2014

Spectral Approaches to Nearest Neighbor SearchAmirali Abdullah, Alexandr Andoni, Ravindran Kannan, Robert Krauthgamer. focs 2014: 581-590 [doi]

A provable SVD-based algorithm for learning topics in dominant admixture corpusTrapit Bansal, Chiranjib Bhattacharyya, Ravindran Kannan. nips 2014: 1997-2005 [doi]

14th Knuth prize: call for nominationsRavindran Kannan. sigact, 45(1):7-8, 2014. [doi]

2012

Computing a nonnegative matrix factorization - provablySanjeev Arora, Rong Ge, Ravindran Kannan, Ankur Moitra. stoc 2012: 145-162 [doi]

Zero-One Rounding of Singular VectorsAmit Deshpande, Ravindran Kannan, Nikhil Srivastava. icalp 2012: 278-289 [doi]

Random Walks on Polytopes and an Affine Interior Point Method for Linear ProgrammingRavindran Kannan, Hariharan Narayanan. mor, 37(1):1-20, 2012. [doi]

2010

Spectral methods for matrices and tensorsRavindran Kannan. stoc 2010: 1-12 [doi]

Clustering with Spectral Norm and the k-Means AlgorithmAmit Kumar, Ravindran Kannan. focs 2010: 299-308 [doi]

2009

A New Probability Inequality Using Typical Moments and Concentration ResultsRavindran Kannan. focs 2009: 211-220 [doi]

2008

The Spectral Method for General Mixture ModelsRavindran Kannan, Hadi Salmasian, Santosh Vempala. SICOMP, 38(3):1141-1156, 2008. [doi]

2005

The Spectral Method for General Mixture ModelsRavindran Kannan, Hadi Salmasian, Santosh Vempala. colt 2005: 444-457 [doi]

2004

The Spectral Method for Mixture ModelsHadi Salmasian, Ravindran Kannan, Santosh Vempala. eccc, (067), 2004. [doi]

1997

Learning an Intersection of a Constant Number of Halfspaces over a Uniform DistributionAvrim Blum, Ravindran Kannan. jcss, 54(2):371-380, 1997.

1987

Sublinear Parallel Algorithm for Computing the Greatest Common Divisor of Two IntegersRavindran Kannan, Gary L. Miller, Larry Rudolph. SICOMP, 16(1):7-16, 1987.

1986

Polynomial-time algorithm for the orbit problemRavindran Kannan, Richard J. Lipton. JACM, 33(4):808-821, 1986. [doi]

1984

Sublinear Parallel Algorithm for Computing the Greatest Common Divisor of Two IntegersRavindran Kannan, Gary L. Miller, Larry Rudolph. focs 1984: 7-11

Towards Separating Nondeterminism from DeterminismRavindran Kannan. mst, 17(1):29-45, 1984.

Polynomial Factorization and Nonrandomness of Bits of Algebraic and Some Transcendental NumbersRavindran Kannan, Arjen K. Lenstra, László Lovász. stoc 1984: 191-200

1983

Polynomial-Time Aggregation of Integer Programming ProblemsRavindran Kannan. JACM, 30(1):133-145, January 1983. [doi]

1981

Exponential Lower Bounds on a Class of Knapsack AlgorithmsDirk Hausmann, Ravindran Kannan, Bernhard Korte. mor, 6(2):225-232, 1981. [doi]

1980

A characterization of threshold matroidsRick Giles, Ravindran Kannan. DM, 30(2):181-184, 1980. [doi]

The Orbit Problem is DecidableRavindran Kannan, Richard J. Lipton. stoc 1980: 252-261

A Polynomial Algorithm for the Two-Variable Integer Programming ProblemRavindran Kannan. JACM, 27(1):118-122, 1980. [doi]

1979

Polynomial Algorithms for Computing the Smith and Hermite Normal Forms of an Integer MatrixRavindran Kannan, Achim Bachem. SICOMP, 8(4):499-507, 1979.

Sign in or sign up to see more results.

runs on WebDSL