default search action
Albert No
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j21]Yunfei Gao
, Albert No
Adaptable DNA Storage Coding: An Efficient Framework for Homopolymer Constraint Transitions. IEEE Access 12: 9976-9983 (2024) - [j20]Kyelim Lee
Needleman-Wunsch Attention: A Framework for Enhancing DNA Sequence Embedding. IEEE Access 12: 69087-69096 (2024) - [j19]Yunfei Gao, Albert No:
Efficient and low-complexity variable-to-variable length coding for DNA storage. BMC Bioinform. 25(1): 320 (2024) - [c18]Wei-Ning Chen, Berivan Isik, Peter Kairouz, Albert No, Sewoong Oh, Zheng Xu:
Improved Communication-Privacy Trade-offs in L2 Mean Estimation under Streaming Differential Privacy. ICML 2024 - [i19]Wei-Ning Chen, Berivan Isik, Peter Kairouz, Albert No, Sewoong Oh, Zheng Xu:
Improved Communication-Privacy Trade-offs in L2 Mean Estimation under Streaming Differential Privacy. CoRR abs/2405.02341 (2024) - [i18]Joo Young Choi, Jaesung R. Park, Inkyu Park, Jaewoong Cho, Albert No, Ernest K. Ryu:
Simple Drop-in LoRA Conditioning on Attention Layers Will Improve Your Diffusion Model. CoRR abs/2405.03958 (2024) - [i17]Dongjae Jeon, Wonje Jeung, Taeheon Kim, Albert No, Jonghyun Choi:
An Information Theoretic Metric for Evaluating Unlearning Models. CoRR abs/2405.17878 (2024) - 2023
- [j18]Sanghoon Kang
Generative Adversarial Networks for DNA Storage Channel Simulator. IEEE Access 11: 3781-3793 (2023) - [j17]Minhyeok Cho
PyNET-Q×Q: An Efficient PyNET Variant for Q×Q Bayer Pattern Demosaicing in CMOS Image Sensors. IEEE Access 11: 44895-44910 (2023) - [j16]Beomseok Seo
How Does a Transformer Learn Compression? An Attention Study on Huffman and LZ4. IEEE Access 11: 140559-140568 (2023) - [j15]Seong-Joon Park
Reducing cost in DNA-based data storage by sequence analysis-aided soft information decoding of variable-length reads. Bioinform. 39(9) (2023) - [c17]Berivan Isik, Wei-Ning Chen, Ayfer Özgür, Tsachy Weissman, Albert No:
Exact Optimality of Communication-Privacy-Utility Tradeoffs in Distributed Mean Estimation. NeurIPS 2023 - [c16]Taeho Yoon, Kibeom Myoung, Keon Lee, Jaewoong Cho, Albert No, Ernest K. Ryu:
Censored Sampling of Diffusion Models Using 3 Minutes of Human Feedback. NeurIPS 2023 - [i16]Berivan Isik, Wei-Ning Chen, Ayfer Özgür, Tsachy Weissman, Albert No:
Exact Optimality of Communication-Privacy-Utility Tradeoffs in Distributed Mean Estimation. CoRR abs/2306.04924 (2023) - [i15]Taeho Yoon, Kibeom Myoung, Keon Lee, Jaewoong Cho, Albert No, Ernest K. Ryu:
Censored Sampling of Diffusion Models Using 3 Minutes of Human Feedback. CoRR abs/2307.02770 (2023) - [i14]Haechang Lee
Fully Quantized Always-on Face Detector Considering Mobile Image Sensors. CoRR abs/2311.01001 (2023) - 2022
- [c15]Berivan Isik, Tsachy Weissman, Albert No:
An Information-Theoretic Justification for Model Pruning. AISTATS 2022: 3821-3846 - [c14]Andrey Ignatov, Radu Timofte
Learned Smartphone ISP on Mobile GPUs with Deep Learning, Mobile AI & AIM 2022 Challenge: Report. ECCV Workshops (3) 2022: 44-70 - [c13]Jinhyuk Park
Prune Your Model Before Distill It. ECCV (11) 2022: 120-136 - [c12]Jongmin Lee, Joo Young Choi, Ernest K. Ryu, Albert No:
Neural Tangent Kernel Analysis of Deep Narrow Neural Networks. ICML 2022: 12282-12351 - [i13]Jongmin Lee, Joo Young Choi, Ernest K. Ryu, Albert No:
Neural Tangent Kernel Analysis of Deep Narrow Neural Networks. CoRR abs/2202.02981 (2022) - [i12]Minhyeok Cho, Haechang Lee, Hyunwoo Je, Kijeong Kim, Dongil Ryu, Jinsu Kim, Jonghyun Bae, Albert No:
PyNET-QxQ: A Distilled PyNET for QxQ Bayer Pattern Demosaicing in CMOS Image Sensor. CoRR abs/2203.04314 (2022) - [i11]Andrey Ignatov, Radu Timofte, Shuai Liu, Chaoyu Feng, Furui Bai, Xiaotao Wang, Lei Lei, Ziyao Yi, Yan Xiang, Zibin Liu, Shaoqing Li, Keming Shi, Dehui Kong, Ke Xu, Minsu Kwon, Yaqi Wu, Jiesi Zheng, Zhihao Fan, Xun Wu, Feng Zhang, Albert No, Minhyeok Cho, Zewen Chen, Xiaze Zhang, Ran Li, Juan Wang, Zhiming Wang, Marcos V. Conde, Ui-Jin Choi, Georgy Perevozchikov, Egor I. Ershov, Zheng Hui, Mengchuan Dong, Xin Lou, Wei Zhou, Cong Pang, Haina Qin, Mingxuan Cai:
Learned Smartphone ISP on Mobile GPUs with Deep Learning, Mobile AI & AIM 2022 Challenge: Report. CoRR abs/2211.03885 (2022) - 2021
- [j14]Jaeho Jeong
Cooperative sequence clustering and decoding for DNA storage system with fountain codes. Bioinform. 37(19): 3136-3143 (2021) - [j13]Minhyeok Cho, Albert No
FCLQC: fast and concurrent lossless quality scores compressor. BMC Bioinform. 22(1): 606 (2021) - [c11]Albert No, Taeho Yoon, Sehyun Kwon, Ernest K. Ryu:
WGAN with an Infinitely Wide Generator Has No Spurious Stationary Points. ICML 2021: 8205-8215 - [i10]Albert No, Taeho Yoon
WGAN with an Infinitely Wide Generator Has No Spurious Stationary Points. CoRR abs/2102.07541 (2021) - [i9]Berivan Isik, Albert No, Tsachy Weissman:
Successive Pruning for Model Compression via Rate Distortion Theory. CoRR abs/2102.08329 (2021) - [i8]Jinhyuk Park, Albert No:
Prune Your Model Before Distill It. CoRR abs/2109.14960 (2021) - 2020
- [j12]Xiaozhou Lu
Error Rate-Based Log-Likelihood Ratio Processing for Low-Density Parity-Check Codes in DNA Storage. IEEE Access 8: 162892-162902 (2020) - [j11]Albert No
CROMqs: An infinitesimal successive refinement lossy compressor for the quality scores. J. Bioinform. Comput. Biol. 18(6): 2050031:1-2050031:22 (2020) - [c10]Hyojung Paik, Sunyong Yoo
DTMBIO 2020: The Fourteenth International Workshop on Data and Text Mining in Biomedical Informatics. CIKM 2020: 3537-3538
2010 – 2019
- 2019
- [j10]Albert No
Universality of Logarithmic Loss in Successive Refinement. Entropy 21(2): 158 (2019) - [j9]Albert No
Universality of Logarithmic Loss in Fixed-Length Lossy Compression. Entropy 21(6): 580 (2019) - [j8]Albert No
Nonasymptotic Upper Bounds on Binary Single Deletion Codes via Mixed Integer Linear Programming. Entropy 21(12): 1202 (2019) - [j7]Minseok Choi
Markov Decision Policies for Dynamic Video Delivery in Wireless Caching Networks. IEEE Trans. Wirel. Commun. 18(12): 5705-5718 (2019) - [i7]Minseok Choi, Albert No, Mingyue Ji, Joongheon Kim:
Markov Decision Policies for Dynamic Video Delivery in Wireless Caching Networks. CoRR abs/1902.10932 (2019) - 2018
- [j6]Albert No
Information Geometric Approach on Most Informative Boolean Function Conjecture. Entropy 20(9): 688 (2018) - [j5]Hyun Kim
SPIHT Algorithm With Adaptive Selection of Compression Ratio Depending on DWT Coefficients. IEEE Trans. Multim. 20(12): 3200-3211 (2018) - 2017
- [i6]Albert No, Tsachy Weissman:
Universality of Logarithmic Loss in Lossy Compression. CoRR abs/1709.00134 (2017) - 2016
- [j4]Albert No, Amir Ingber, Tsachy Weissman:
Strong Successive Refinability and Rate-Distortion-Complexity Tradeoff. IEEE Trans. Inf. Theory 62(6): 3618-3635 (2016) - [j3]Albert No
Rateless Lossy Compression via the Extremes. IEEE Trans. Inf. Theory 62(10): 5484-5495 (2016) - [c9]Idoia Ochoa
CROMqs: an infinitesimal successive refinement lossy compressor for the quality scores. ITW 2016: 121-125 - 2015
- [c8]Albert No, Tsachy Weissman:
Universality of logarithmic loss in lossy compression. ISIT 2015: 2166-2170 - [i5]Albert No, Amir Ingber, Tsachy Weissman:
Strong Successive Refinability and Rate-Distortion-Complexity Tradeoff. CoRR abs/1506.03407 (2015) - 2014
- [j2]Albert No, Tsachy Weissman:
Minimax Filtering Regret via Relations Between Information and Estimation. IEEE Trans. Inf. Theory 60(8): 4832-4847 (2014) - [j1]Jiantao Jiao, Thomas A. Courtade, Albert No, Kartik Venkat, Tsachy Weissman:
Information Measures: The Curious Case of the Binary Alphabet. IEEE Trans. Inf. Theory 60(12): 7616-7626 (2014) - [c7]Albert No, Tsachy Weissman:
Rateless lossy compression via the extremes. Allerton 2014: 88-92 - [c6]Jiantao Jiao, Thomas A. Courtade, Albert No, Kartik Venkat, Tsachy Weissman:
Information divergences and the curious case of the binary alphabet. ISIT 2014: 351-355 - [c5]Albert No, Amir Ingber, Tsachy Weissman:
Strong successive refinability: Sufficient conditions. ISIT 2014: 2659-2663 - [i4]Jiantao Jiao, Thomas A. Courtade, Albert No, Kartik Venkat, Tsachy Weissman:
Information Measures: the Curious Case of the Binary Alphabet. CoRR abs/1404.6810 (2014) - [i3]Albert No, Tsachy Weissman:
Rateless Lossy Compression via the Extremes. CoRR abs/1406.6730 (2014) - 2013
- [c4]Albert No, Amir Ingber, Tsachy Weissman:
Complexity and rate-distortion tradeoff via successive refinement. Allerton 2013: 1531-1536 - [c3]Albert No, Tsachy Weissman:
Minimax filtering regret via relations between information and estimation. ISIT 2013: 444-448 - [i2]Albert No, Tsachy Weissman:
Minimax Filtering Regret via Relations between Information and Estimation. CoRR abs/1301.5096 (2013) - 2012
- [c2]Albert No, Kartik Venkat, Tsachy Weissman:
Joint source-channel coding of one random variable over the Poisson channel. ISIT 2012: 2122-2126 - [c1]Bobbie Chern, Idoia Ochoa
Reference based genome compression. ITW 2012: 427-431 - [i1]Bobbie Chern, Idoia Ochoa, Alexandros Manolakos, Albert No, Kartik Venkat, Tsachy Weissman:
Reference Based Genome Compression. CoRR abs/1204.1912 (2012)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-08 20:34 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: