60 results on '"A. Salman Avestimehr"'
Search Results
2. Predicting Uncertainty of Generative LLMs with MARS: Meaning-Aware Response Scoring.
3. Statistical Minimax Lower Bounds for Transfer Learning in Linear Binary Classification.
4. Analog Privacy-Preserving Coded Computing.
5. List-Decodable Coded Computing: Breaking the Adversarial Toleration Barrier.
6. Coded Computing in Unknown Environment via Online Learning.
7. Entangled Polynomial Codes for Secure, Private, and Batch Distributed Matrix Multiplication: Breaking the 'Cubic' Barrier.
8. Interactive Verifiable Polynomial Evaluation.
9. Hierarchical Coded Gradient Aggregation for Learning at the Edge.
10. PolyShard: Coded Sharding Achieves Linearly Scaling Efficiency and Security Simultaneously.
11. Tree Gradient Coding.
12. INTERPOL: Information Theoretically Verifiable Polynomial Evaluation.
13. Download and Access Trade-offs in Lagrange Coded Computing.
14. Harmonic Coding: An Optimal Linear Code for Privacy-Preserving Gradient-Type Computation.
15. Timely Coded Computing.
16. Fitting ReLUs via SGD and Quantized SGD.
17. Coded Computing for Distributed Graph Analytics.
18. Compressed Coded Distributed Computing.
19. Straggler Mitigation in Distributed Matrix Multiplication: Fundamental Limits and Optimal Coding.
20. Communication-Aware Scheduling of Serial Tasks for Dispersed Computing.
21. The exact rate-memory tradeoff for caching with uncoded prefetching.
22. Characterizing the rate-memory tradeoff in cache networks within a factor of 2.
23. On the optimality of separation between caching and delivery in general cache networks.
24. Communication-aware computing for edge processing.
25. Capacity region of the symmetric injective K-user Deterministic Interference Channel.
26. Coded computation over heterogeneous clusters.
27. Fundamental tradeoff between computation and communication in distributed computing.
28. Topological interference management with reconfigurable antennas.
29. Fundamental limits of cache-aided interference management.
30. Active learning for community detection in stochastic block models.
31. Rover-to-orbiter communication in Mars: Taking advantage of the varying topology.
32. Blind index coding.
33. A general outer bound for MISO broadcast channel with heterogeneous CSIT.
34. When does an ensemble of matrices with randomly scaled rows lose rank?
35. Binary Fading Interference Channel with No CSIT.
36. Blind wiretap channel with delayed CSIT.
37. A generalized cut-set bound for deterministic multi-flow networks and its applications.
38. ITLinQ: A new approach for spectrum sharing in device-to-device communication systems.
39. Linear degrees of freedom of the MIMO X-channel with delayed CSIT.
40. Align-and-forward relaying for two-hop erasure broadcast channels.
41. Two-hop interference channels: Impact of linear time-varying schemes.
42. Network compression: Worst-case analysis.
43. On efficient min-cut approximations in half-duplex relay networks.
44. Impact of topology on interference networks with no CSIT.
45. On degrees of freedom scaling in layered interference networks with delayed CSI.
46. Is Gaussian noise the worst-case additive noise in wireless networks?
47. Binary fading interference channel with delayed feedback.
48. Bounds on the minimum energy-per-bit for bursty traffic in diamond networks.
49. Approximating the timely throughput of heterogeneous wireless networks.
50. On the sum-capacity with successive decoding in interference channels.
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.