Albert No

Orcid: 0000-0002-6346-4182

According to our database1, Albert No authored at least 38 papers between 2012 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Adaptable DNA Storage Coding: An Efficient Framework for Homopolymer Constraint Transitions.
IEEE Access, 2024

2023
Reducing cost in DNA-based data storage by sequence analysis-aided soft information decoding of variable-length reads.
Bioinform., September, 2023

Fully Quantized Always-on Face Detector Considering Mobile Image Sensors.
CoRR, 2023

How Does a Transformer Learn Compression? An Attention Study on Huffman and LZ4.
IEEE Access, 2023

Generative Adversarial Networks for DNA Storage Channel Simulator.
IEEE Access, 2023

PyNET-Q×Q: An Efficient PyNET Variant for Q×Q Bayer Pattern Demosaicing in CMOS Image Sensors.
IEEE Access, 2023

Censored Sampling of Diffusion Models Using 3 Minutes of Human Feedback.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Exact Optimality of Communication-Privacy-Utility Tradeoffs in Distributed Mean Estimation.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

2022
PyNET-QxQ: A Distilled PyNET for QxQ Bayer Pattern Demosaicing in CMOS Image Sensor.
CoRR, 2022

Neural Tangent Kernel Analysis of Deep Narrow Neural Networks.
Proceedings of the International Conference on Machine Learning, 2022

Prune Your Model Before Distill It.
Proceedings of the Computer Vision - ECCV 2022, 2022


An Information-Theoretic Justification for Model Pruning.
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2022

2021
Successive Pruning for Model Compression via Rate Distortion Theory.
CoRR, 2021

WGAN with an Infinitely Wide Generator Has No Spurious Stationary Points.
CoRR, 2021

FCLQC: fast and concurrent lossless quality scores compressor.
BMC Bioinform., 2021

Cooperative sequence clustering and decoding for DNA storage system with fountain codes.
Bioinform., 2021

WGAN with an Infinitely Wide Generator Has No Spurious Stationary Points.
Proceedings of the 38th International Conference on Machine Learning, 2021

2020
CROMqs: An infinitesimal successive refinement lossy compressor for the quality scores.
J. Bioinform. Comput. Biol., 2020

Error Rate-Based Log-Likelihood Ratio Processing for Low-Density Parity-Check Codes in DNA Storage.
IEEE Access, 2020

DTMBIO 2020: The Fourteenth International Workshop on Data and Text Mining in Biomedical Informatics.
Proceedings of the CIKM '20: The 29th ACM International Conference on Information and Knowledge Management, 2020

2019
Markov Decision Policies for Dynamic Video Delivery in Wireless Caching Networks.
IEEE Trans. Wirel. Commun., 2019

Nonasymptotic Upper Bounds on Binary Single Deletion Codes via Mixed Integer Linear Programming.
Entropy, 2019

Universality of Logarithmic Loss in Fixed-Length Lossy Compression.
Entropy, 2019

Universality of Logarithmic Loss in Successive Refinement.
Entropy, 2019

2018
SPIHT Algorithm With Adaptive Selection of Compression Ratio Depending on DWT Coefficients.
IEEE Trans. Multim., 2018

Information Geometric Approach on Most Informative Boolean Function Conjecture.
Entropy, 2018

2016
Rateless Lossy Compression via the Extremes.
IEEE Trans. Inf. Theory, 2016

Strong Successive Refinability and Rate-Distortion-Complexity Tradeoff.
IEEE Trans. Inf. Theory, 2016

CROMqs: an infinitesimal successive refinement lossy compressor for the quality scores.
Proceedings of the 2016 IEEE Information Theory Workshop, 2016

2015
Universality of logarithmic loss in lossy compression.
Proceedings of the IEEE International Symposium on Information Theory, 2015

2014
Minimax Filtering Regret via Relations Between Information and Estimation.
IEEE Trans. Inf. Theory, 2014

Information Measures: The Curious Case of the Binary Alphabet.
IEEE Trans. Inf. Theory, 2014

Strong successive refinability: Sufficient conditions.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

Information divergences and the curious case of the binary alphabet.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

2013
Complexity and rate-distortion tradeoff via successive refinement.
Proceedings of the 51st Annual Allerton Conference on Communication, 2013

2012
Reference based genome compression.
Proceedings of the 2012 IEEE Information Theory Workshop, 2012

Joint source-channel coding of one random variable over the Poisson channel.
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012


  Loading...