On approximating matrix norms in data streams
This paper presents a systematic study of the space complexity of estimating the Schatten p-norms of an n×n matrix in the turnstile streaming model. Both kinds of space complexities, bit complexity and sketching dimension, are considered. Furthermore, two sketching models, general linear sketching a...
Saved in:
Main Authors: | , , |
---|---|
其他作者: | |
格式: | Article |
語言: | English |
出版: |
2021
|
主題: | |
在線閱讀: | https://hdl.handle.net/10356/146275 |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|