共 50 条
- [1] On achieving optimal throughput with network coding [J]. IEEE INFOCOM 2005: THE CONFERENCE ON COMPUTER COMMUNICATIONS, VOLS 1-4, PROCEEDINGS, 2005, : 2184 - 2194
- [3] Nearly Minimax Optimal Regret for Learning Linear Mixture Stochastic Shortest Path [J]. INTERNATIONAL CONFERENCE ON MACHINE LEARNING, VOL 202, 2023, 202
- [4] Achieving Optimal Dynamic Regret for Non-stationary Bandits without Prior Information [J]. CONFERENCE ON LEARNING THEORY, VOL 99, 2019, 99
- [7] Coding using Gaussian mixture and generalized Gaussian models [J]. INTERNATIONAL CONFERENCE ON IMAGE PROCESSING, PROCEEDINGS - VOL I, 1996, : 217 - 220