Albert No
Albert No
Assistant Professor of Electronic and Electrical Engineering at Hongik University
Dirección de correo verificada de hongik.ac.kr
Título
Citado por
Citado por
Año
Deterministic matrices matching the compressed sensing phase transitions of Gaussian random matrices
H Monajemi, S Jafarpour, M Gavish, DL Donoho, ...
Proceedings of the National Academy of Sciences 110 (4), 1181-1186, 2013
852013
Information measures: the curious case of the binary alphabet
J Jiao, TA Courtade, A No, K Venkat, T Weissman
IEEE Transactions on Information Theory 60 (12), 7616-7626, 2014
292014
Reference based genome compression
BG Chern, I Ochoa, A Manolakos, A No, K Venkat, T Weissman
2012 IEEE Information Theory Workshop, 427-431, 2012
272012
Strong successive refinability and rate-distortion-complexity tradeoff
A No, A Ingber, T Weissman
IEEE Transactions on Information Theory 62 (6), 3618-3635, 2016
202016
Universality of logarithmic loss in lossy compression
A No, T Weissman
2015 IEEE International Symposium on Information Theory (ISIT), 2166-2170, 2015
122015
Rateless lossy compression via the extremes
A No, T Weissman
IEEE transactions on information theory 62 (10), 5484-5495, 2016
72016
SPIHT algorithm with adaptive selection of compression ratio depending on DWT coefficients
H Kim, A No, HJ Lee
IEEE Transactions on Multimedia 20 (12), 3200-3211, 2018
42018
Markov Decision Policies for Dynamic Video Delivery in Wireless Caching Networks
M Choi, A No, M Ji, J Kim
IEEE Transactions on Wireless Communications 18 (12), 5705-5718, 2019
32019
Universality of logarithmic loss in successive refinement
A No
Entropy 21 (2), 158, 2019
32019
Minimax filtering regret via relations between information and estimation
A No, T Weissman
IEEE transactions on information theory 60 (8), 4832-4847, 2014
32014
Complexity and rate-distortion tradeoff via successive refinement
A No, A Ingber, T Weissman
2013 51st Annual Allerton Conference on Communication, Control, and …, 2013
22013
Minimax Filtering via Relations between Information and Estimation
A No, T Weissman
arXiv preprint arXiv:1301.5096, 2013
22013
Joint source-channel coding of one random variable over the Poisson channel
A No, K Venkat, T Weissman
2012 IEEE International Symposium on Information Theory Proceedings, 2122-2126, 2012
22012
Information Geometric Approach on Most Informative Boolean Function Conjecture
A No
Entropy 20 (9), 688, 2018
12018
CROMqs: an infinitesimal successive refinement lossy compressor for the quality scores
I Ochoa, A No, M Hernaez, T Weissman
2016 IEEE Information Theory Workshop (ITW), 121-125, 2016
12016
Information divergences and the curious case of the binary alphabet
J Jiao, T Courtade, A No, K Venkat, T Weissman
2014 IEEE International Symposium on Information Theory, 351-355, 2014
12014
Analysis on Color Filter Array Image Compression Methods
SH Park, A No
12009
Nonasymptotic Upper Bounds on Binary Single Deletion Codes via Mixed Integer Linear Programming
A No
Entropy 21 (12), 1202, 2019
2019
Universality of Logarithmic Loss in Fixed-Length Lossy Compression
A No
Entropy 21 (6), 580, 2019
2019
Strong successive refinability: Sufficient conditions
A No, A Ingber, T Weissman
2014 IEEE International Symposium on Information Theory, 2659-2663, 2014
2014
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–20