246 results on '"James R Lee"'
Search Results
2. Non-Existence of Annular Separators in Geometric Graphs.
3. Phi-3 Technical Report: A Highly Capable Language Model Locally on Your Phone.
4. Sparsifying Sums of Norms.
5. Spectral Hypergraph Sparsification via Chaining.
6. Multiscale Entropic Regularization for MTS on General Metric Spaces.
7. Pure Entropic Regularization for Metrical Task Systems.
8. Sparsifying generalized linear models.
9. Metrical Task Systems on Trees via Mirror Descent and Unfair Gluing.
10. Pure entropic regularization for metrical task systems.
11. Flow-Cut Gaps and Face Covers in Planar Graphs.
12. Metrical task systems on trees via mirror descent and unfair gluing.
13. Adversarial Hypothesis Testing and a Quantum Stein's Lemma for Restricted Measurements.
14. Spectral hypergraph sparsification via chaining.
15. Fusible HSTs and the Randomized k-Server Conjecture.
16. k-server via multiscale entropic regularization.
17. Non-existence of annular separators in geometric graphs.
18. Multiscale entropic regularization for MTS on general metric spaces.
19. Separators in Region Intersection Graphs.
20. Covering the Large Spectrum and Generalized Riesz Products.
21. Talagrand's Convolution Conjecture on Gaussian Space.
22. Lower Bounds on the Size of Semidefinite Programming Relaxations.
23. Approximate Constraint Satisfaction Requires Large LP Relaxations.
24. On the Power of Symmetric LP and SDP Relaxations.
25. Adversarial hypothesis testing and a quantum stein's lemma for restricted measurements.
26. Metrical task systems on trees via mirror descent and unfair gluing.
27. Flow-Cut Gaps and Face Covers in Planar Graphs.
28. A node-capacitated Okamura-Seymour theorem.
29. Approximate Constraint Satisfaction Requires Large LP Relaxations.
30. A node-capacitated okamura-seymour theorem.
31. On the 2-sum embedding conjecture.
32. Multi-way spectral partitioning and higher-order cheeger inequalities.
33. Dimension reduction for finite trees in l1.
34. Cover times, blanket times, and majorizing measures.
35. Near-optimal distortion bounds for embedding doubling spaces into L1.
36. Bilipschitz snowflakes and metrics of negative type.
37. Genus and the Geometry of the Cut Graph.
38. k-server via multiscale entropic regularization.
39. Higher Eigenvalues of Graphs.
40. On the geometry of graphs with a forbidden minor.
41. Randomly removing g handles at once.
42. Expander codes over reals, Euclidean sections, and compressed sensing.
43. On the Optimality of Gluing over Scales.
44. Multiway Spectral Partitioning and Higher-Order Cheeger Inequalities.
45. Eigenvalue Bounds, Spectral Partitioning, and Metrical Deformations via Flows.
46. Embeddings of Topological Graphs: Lossy Invariants, Linearization, and 2-Sums.
47. Euclidean Sections of with Sublinear Randomness and Error-Correction over the Reals.
48. Almost Euclidean subspaces of lN1 via expander codes.
49. Vertex cuts, random walks, and dimension reduction in series-parallel graphs.
50. Coarse Differentiation and Multi-flows in Planar Graphs.
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.