75 results on '"John Wright"'
Search Results
2. A One-Query Lower Bound for Unitary Synthesis and Breaking Quantum Cryptography.
3. Unique Games hardness of Quantum Max-Cut, and a conjectured vector-valued Borell's inequality.
4. Testing matrix product states.
5. Hammer: a modular and reusable physical design flow tool: invited.
6. Quantum soundness of testing tensor codes.
7. Deep Networks Provably Classify Data on Curves.
8. Square Root Principal Component Pursuit: Tuning-Free Noisy Robust Matrix Recovery.
9. NEEXP is Contained in MIP.
10. Quantum state certification.
11. Efficient Dictionary Learning with Gradient Descent.
12. Geometry and Symmetry in Short-and-Sparse Deconvolution.
13. Deep Networks and the Multiple Manifold Problem.
14. Short and Sparse Deconvolution - A Geometric Approach.
15. Structured Local Minima in Sparse Blind Deconvolution.
16. Endogenous Fluorescence Lifetime Imaging (FLIM) Endoscopy For Early Detection Of Oral Cancer And Dysplasia.
17. A 28nm FDSOI 8192-point digital ASIC spectrometer from a Chisel generator.
18. Efficient Model-Free Learning to Overcome Hardware Nonidealities in Analog-to-Information Converters.
19. Which Distribution Distances are Sublinearly Testable?
20. Efficient quantum tomography II.
21. Convolutional Phase Retrieval.
22. On the Global Geometry of Sphere-Constrained Sparse Blind Deconvolution.
23. Theory and Design of a Direct Space-to-Information Converter for Rapid Detection of Interferer DoA.
24. Efficient quantum tomography.
25. Band-pass compressive sampling as an enabling technology for rapid wideband RF spectrum sensing.
26. A geometric analysis of phase retrieval.
27. Adaptivity Helps for Testing Juntas.
28. Quantum Spectrum Testing.
29. Beating the Random Assignment on Constraint Satisfaction Problems of Bounded Degree.
30. Improved NP-Inapproximability for 2-Variable Linear Equations.
31. Complete Dictionary Recovery Using Nonconvex Optimization.
32. Optimal Strong Parallel Repetition for Projection Games on Low Threshold Rank Graphs.
33. A Composition Theorem for Parity Kill Number.
34. Finding a sparse vector in a subspace: Linear sparsity using alternating directions.
35. Decision trees, protocols and the entropy-influence conjecture.
36. On the local correctness of ℓ1-minimization for dictionary learning.
37. Square Deal: Lower Bounds and Improved Relaxations for Tensor Recovery.
38. Hardness of Robust Graph Isomorphism, Lasserre Gaps, and Asymmetry of Random Graphs.
39. 19.4 A 2.7-to-3.7GHz rapid interférer detector exploiting compressed sampling with a quadrature analog-to-information converter.
40. Fast Subspace Search via Grassmannian Based Hashing.
41. Toward Guaranteed Illumination Models for Non-convex Objects.
42. Exact Recovery of Sparse-Used Dictionaries.
43. A new point of NP-hardness for unique games.
44. Learning with Partially Absorbing Random Walks.
45. A New Point of NP-Hardness for 2-to-1 Label Cover.
46. Principal Component Pursuit with reduced linear measurements.
47. Compressive principal component pursuit.
48. Efficient Point-to-Subspace Query in ℓ1 with Application to Robust Face Recognition.
49. Accelerated Large Scale Optimization by Concomitant Hashing.
50. The Fourier Entropy-Influence Conjecture for Certain Classes of Boolean Functions.
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.