Zobrazeno 1 - 10
of 654
pro vyhledávání: '"Y F, Tan"'
Publikováno v:
IEEE Transactions on Information Forensics and Security. 18:831-845
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
IEEE Transactions on Signal Processing. 70:2681-2697
In this paper, we design and analyze MC2G (Matrix Completion with 2 Graphs), an algorithm that performs matrix completion in the presence of social and item similarity graphs. MC2G runs in quasilinear time and is parameter free. It is based on spectr
Publikováno v:
IEEE Transactions on Information Theory. 67:7708-7722
This study investigates the fundamental limits of variable-length compression in which prefix-free constraints are not imposed (i.e., one-to-one codes are studied) and non-vanishing error probabilities are permitted. Due in part to a crucial relation
Publikováno v:
Kemija u Industriji, Vol 64, Iss 5-6, Pp 247-254 (2015)
Carboxymethyl cellulose (CMC) is a kind of cellulose ether widely used in industrial production. CMC wastewater usually have high chemical oxygen demand (COD) and salinity (>10 %), which result from organic and inorganic by-products during CMC produc
Externí odkaz:
https://doaj.org/article/242dd92ed6634d58a94ec5b5f0cac2c8
Publikováno v:
2022 IEEE Information Theory Workshop (ITW).
Publikováno v:
2022 IEEE Information Theory Workshop (ITW).
The Chow-Liu algorithm (IEEE Trans.~Inform.~Theory, 1968) has been a mainstay for the learning of tree-structured graphical models from i.i.d.\ sampled data vectors. Its theoretical properties have been well-studied and are well-understood. In this p
Publikováno v:
2022 IEEE Information Theory Workshop (ITW).
The beam alignment (BA) problem consists in accurately aligning the transmitter and receiver beams to establish a reliable communication link in wireless communication systems. Existing BA methods search the entire beam space to identify the optimal
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::67cac89d6368cb2b25a83c9b50d0128c
http://arxiv.org/abs/2210.12625
http://arxiv.org/abs/2210.12625
Autor:
Vincent Y. F. Tan, Yonglong Li
Publikováno v:
IEEE Transactions on Information Theory. 67:2663-2679
We consider the class of channels formed from the concatenation of a deletion channel and a finite-state channel. For this class of channels, we show that the operationally-defined capacity is equal to the stationary capacity. We also show that the s