The following pages link to Santosh Vempala (Q298157):
Displaying 50 items.
- (Q208491) (redirect page) (← links)
- A practical volume algorithm (Q298158) (← links)
- Flow metrics (Q596135) (← links)
- A spectral algorithm for learning mixture models (Q598259) (← links)
- Clustering large graphs via the singular value decomposition (Q703073) (← links)
- An algorithmic theory of learning: robust concepts and random projection (Q851862) (← links)
- Kernels as features: on kernels, margins, and low-dimensional mappings (Q851869) (← links)
- Network design via iterative rounding of setpair relaxations (Q858116) (← links)
- Dispersion of mass and the complexity of randomized geometric algorithms (Q947778) (← links)
- Logconcave random graphs (Q986716) (← links)
- A polynomial-time algorithm for learning noisy linear threshold functions (Q1271190) (← links)
- The Colin de Verdière number and sphere representations of a graph (Q1280274) (← links)
- A constant-factor approximation algorithm for the \(k\)-MST problem (Q1305925) (← links)
- Latent semantic indexing: A probabilistic analysis (Q1591153) (← links)
- A note on non-degenerate integer programs with small sub-determinants (Q1755835) (← links)
- Optimal outlier removal in high-dimensional spaces (Q1887715) (← links)
- Semi-definite relaxations for minimum bandwidth and other vertex-ordering problems (Q1978696) (← links)
- Socially fair network design via iterative rounding (Q2084030) (← links)
- Geometric random edge (Q2364496) (← links)
- Simulated annealing in convex bodies and an \(O^{*}(n^{4}\)) volume algorithm (Q2490265) (← links)
- On the approximability of the traveling salesman problem (Q2495698) (← links)
- An algorithmic theory of learning: Robust concepts and random projection (Q2499543) (← links)
- Efficient algorithms for online decision problems (Q2568459) (← links)
- (Q2753746) (← links)
- The Cutting Plane Method is Polynomial for Perfect Matchings (Q2800362) (← links)
- Local Versus Global Properties of Metric Spaces (Q2884582) (← links)
- A Deterministic Polynomial-Time Approximation Scheme for Counting Knapsack Solutions (Q2903521) (← links)
- (Q2908836) (← links)
- On the Complexity of Random Satisfiability Problems with Planted Solutions (Q2941491) (← links)
- Bypassing KLS (Q2941546) (← links)
- Randomly-oriented k-d Trees Adapt to Intrinsic Dimension (Q2957480) (← links)
- Integer feasibility of random polytopes (Q2988898) (← links)
- A random-sampling-based algorithm for learning intersections of halfspaces (Q2999781) (← links)
- (Q3002774) (← links)
- (Q3044352) (← links)
- Algorithmic Extensions of Cheeger’s Inequality to Higher Eigenvalues and Partitions (Q3088104) (← links)
- Semantic Communication for Simple Goals Is Equivalent to On-line Learning (Q3093958) (← links)
- On Noise-Tolerant Learning of Sparse Parities and Related Problems (Q3093968) (← links)
- On Nash-Equilibria of Approximation-Stable Games (Q3162509) (← links)
- An Efficient Rescaled Perceptron Algorithm for Conic Systems (Q3169054) (← links)
- On the approximability of the traveling salesman problem (extended abstract) (Q3191979) (← links)
- Efficient Convex Optimization with Oracles (Q3295271) (← links)
- Algorithmic Prediction of Health-Care Costs (Q3392257) (← links)
- The geometry of logconcave functions and sampling algorithms (Q3437021) (← links)
- Adaptive simulated annealing: A near-optimal connection between sampling and counting (Q3452215) (← links)
- Stochastic Billiards for Sampling from the Boundary of a Convex Set (Q3465938) (← links)
- Approximation algorithms for minimum-cost k-vertex connected subgraphs (Q3579233) (← links)
- Hit-and-run from a corner (Q3580977) (← links)
- Tensor decomposition and approximation schemes for constraint satisfaction problems (Q3581412) (← links)
- Matrix approximation and projective clustering via volume sampling (Q3581518) (← links)
