no code implementations • 30 Mar 2023 • Meng He, Ran Li, Chuan Huang, Shulong Zhang
To this end, we propose a joint model and data driven distributed estimation method by designing the optimal quantizers and fusion center (FC) based on the Bayesian and minimum mean square error (MMSE) criterions.
no code implementations • 7 Jul 2021 • Dawen Xu, Meng He, Cheng Liu, Ying Wang, Long Cheng, Huawei Li, Xiaowei Li, Kwang-Ting Cheng
It takes the remote AIoT processor with soft errors in the training loop such that the on-site computing errors can be learned with the application data on the server and the retrained models can be resilient to the soft errors.
no code implementations • 15 May 2020 • Meng He, J. Ian Munro, Yakov Nekrich, Sebastian Wild, Kaiyu Wu
We present the first succinct distance oracles for (unweighted) interval graphs and related classes of graphs, using a novel succinct data structure for ordinal trees that supports the mapping between preorder (i. e., depth-first) ranks and level-order (breadth-first) ranks of nodes in constant time.
Data Structures and Algorithms