default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDChung Chan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j18]Chao Zhao
, Ali Al-Bashabsheh, Chung Chan:
Game Theoretic Clustering for Finding Strong Communities. Entropy 26(3): 268 (2024)- [c45]Chao Zhao, Zimeng Wang, Qiaoqiao Zhou, Chee-Wei Tan, Chung Chan:
Infodemic Source Detection: Enhanced Formulations with Information Flow. ISIT 2024: 3291-3296 - [c44]Chao Zhao, Ali Al-Bashabsheh, Chung Chan:
Detecting Informationally-Dense Subsets. ITW 2024: 771-776 - 2023
- [j17]Xu Wang, Ali Al-Bashabsheh, Chao Zhao, Chung Chan:
Smoothed noise contrastive mutual information neural estimation. J. Frankl. Inst. 360(16): 12415-12435 (2023) - [j16]Praneeth Kumar Vippathalla, Chung Chan, Navin Kashyap, Qiaoqiao Zhou:
Secret Key Agreement via Secure Omniscience. IEEE Trans. Inf. Theory 69(12): 8029-8053 (2023) - [c43]Chung Chan, Chao Zhao, Wai Tong Chau, Yu Zhou, Qihang Liang, Michael Lim:
E-Quiz: Empowering Educators with a Self-Contained and Programmable Online Exam System. TALE 2023: 1-8 - 2022
- [c42]Xu Wang, Ali Al-Bashabsheh, Chao Zhao, Chung Chan:
Smoothed InfoNCE: Breaking the log N Curse without Overshooting. ISIT 2022: 724-729 - [c41]Qihang Liang, Chung Chan:
Improved Adversarial Robustness by Hardened Prediction. ISIT 2022: 2952-2956 - [c40]Praneeth Kumar Vippathalla, Chung Chan, Navin Kashyap, Qiaoqiao Zhou:
Positivity of Secret Key Capacity for Hypergraphical Sources with a Linear Wiretapper. ITW 2022: 726-731 - [c39]Chung Chan, Assan Kozhin, Qihang Liang, Glenn Salter, Ruoqin Tang, Chunxiao Ye, Chao Zhao:
DIVE: Make Online Learning Diversified, Interactive, Versatile, and Engaging. TALE 2022: 482-489 - 2021
- [j15]Chung Chan, Ali Al-Bashabsheh, Qiaoqiao Zhou:
Agglomerative Info-Clustering: Maximizing Normalized Total Correlation. IEEE Trans. Inf. Theory 67(3): 2001-2011 (2021) - [c38]Xu Wang, Ali Al-Bashabsheh, Chao Zhao, Chung Chan:
Adaptive Label Smoothing for Classifier-based Mutual Information Neural Estimation. ISIT 2021: 1035-1040 - [c37]Praneeth Kumar Vippathalla, Chung Chan, Navin Kashyap, Qiaoqiao Zhou:
Secret Key Agreement and Secure Omniscience of Tree-PIN Source with Linear Wiretapper. ISIT 2021: 1624-1629 - [c36]Junyu Chen, Evren Asma, Chung Chan:
Targeted Gradient Descent: A Novel Method for Convolutional Neural Networks Fine-Tuning and Online-Learning. MICCAI (3) 2021: 25-35 - [i26]Praneeth Kumar Vippathalla, Chung Chan, Navin Kashyap, Qiaoqiao Zhou:
Secret Key Agreement and Secure Omniscience of Tree-PIN Source with Linear Wiretapper. CoRR abs/2102.01771 (2021) - [i25]Junyu Chen, Evren Asma, Chung Chan:
Targeted Gradient Descent: A Novel Method for Convolutional Neural Networks Fine-tuning and Online-learning. CoRR abs/2109.14729 (2021) - [i24]Praneeth Kumar Vippathalla, Chung Chan, Navin Kashyap, Qiaoqiao Zhou:
Wiretap Secret Key Agreement Via Secure Omniscience. CoRR abs/2112.00394 (2021) - 2020
- [j14]Qiaoqiao Zhou, Chung Chan:
Secret Key Generation for Minimally Connected Hypergraphical Sources. IEEE Trans. Inf. Theory 66(7): 4226-4244 (2020) - [c35]Qiaoqiao Zhou, Chung Chan, Raymond W. Yeung:
On the Discussion Rate Region for the PIN Model. ISIT 2020: 955-959 - [c34]Chung Chan, Navin Kashyap, Praneeth Kumar Vippathalla, Qiaoqiao Zhou:
Secure Information Exchange for Omniscience. ISIT 2020: 966-971
2010 – 2019
- 2019
- [j13]Chung Chan, Manuj Mukherjee, Navin Kashyap, Qiaoqiao Zhou:
Upper Bounds via Lamination on the Constrained Secrecy Capacity of Hypergraphical Sources. IEEE Trans. Inf. Theory 65(8): 5080-5093 (2019) - [c33]Chung Chan, Ali Al-Bashabsheh, Da Sun Handason Tam, Chao Zhao:
Finding Better Web Communities in Digraphs via Max-Flow Min-Cut. ISIT 2019: 410-414 - [c32]Chung Chan, Navin Kashyap, Praneeth Kumar Vippathalla, Qiaoqiao Zhou:
One-Shot Perfect Secret Key Agreement for Finite Linear Sources. ISIT 2019: 947-951 - [i23]Chung Chan, Navin Kashyap, Praneeth Kumar Vippathalla, Qiaoqiao Zhou:
One-Shot Perfect Secret Key Agreement for Finite Linear Sources. CoRR abs/1901.05817 (2019) - [i22]Chung Chan, Manuj Mukherjee, Praneeth Kumar Vippathalla, Qiaoqiao Zhou:
Multiterminal Secret Key Agreement with Nearly No Discussion. CoRR abs/1904.11383 (2019) - [i21]Chung Chan, Ali Al-Bashabsheh, Hing Pang Huang, Michael Lim, Da Sun Handason Tam, Chao Zhao:
Neural Entropic Estimation: A faster path to mutual information estimation. CoRR abs/1905.12957 (2019) - [i20]Chung Chan:
Secret key agreement for hypergraphical sources with limited total discussion. CoRR abs/1910.01894 (2019) - 2018
- [j12]Chung Chan, Ali Al-Bashabsheh, Qiaoqiao Zhou:
Change of Multivariate Mutual Information: From Local to Global. IEEE Trans. Inf. Theory 64(1): 57-76 (2018) - [j11]Ni Ding, Chung Chan, Qiaoqiao Zhou, Rodney A. Kennedy, Parastoo Sadeghi:
Determining Optimal Rates for Communication for Omniscience. IEEE Trans. Inf. Theory 64(3): 1919-1944 (2018) - [j10]Chung Chan, Manuj Mukherjee, Navin Kashyap, Qiaoqiao Zhou:
On the Optimality of Secret Key Agreement via Omniscience. IEEE Trans. Inf. Theory 64(4): 2371-2389 (2018) - [j9]Chung Chan, John A. Onofrey, Yiqiang Jian, Mary Germino, Xenophon Papademetris, Richard E. Carson, Chi Liu:
Non-Rigid Event-by-Event Continuous Respiratory Motion Compensated List-Mode Reconstruction for PET. IEEE Trans. Medical Imaging 37(2): 504-515 (2018) - [c31]Chung Chan, Ali Al-Bashabsheh, Qiaoqiao Zhou:
Agglomerative Info-Clustering. ISIT 2018: 1725-1729 - [c30]Chung Chan, Manuj Mukherjee, Navin Kashyap, Qiaoqiao Zhou:
Multiterminal Secret Key Agreement at Asymptotically Zero Discussion Rate. ISIT 2018: 2654-2658 - [c29]Qiaoqiao Zhou, Chung Chan:
Secrecy Capacity under Limited Discussion Rate for Minimally Connected Hypergraphical Sources. ISIT 2018: 2664-2668 - [i19]Chung Chan, Manuj Mukherjee, Navin Kashyap, Qiaoqiao Zhou:
Multiterminal Secret Key Agreement at Asymptotically Zero Discussion Rate. CoRR abs/1802.04955 (2018) - [i18]Chung Chan, Manuj Mukherjee, Navin Kashyap, Qiaoqiao Zhou:
Upper Bounds via Lamination on the Constrained Secrecy Capacity of Hypergraphical Sources. CoRR abs/1805.01115 (2018) - [i17]Qiaoqiao Zhou, Chung Chan:
Secrecy Capacity under Limited Discussion Rate for Minimally Connected Hypergraphical Sources. CoRR abs/1805.03110 (2018) - 2017
- [j8]Chung Chan:
Compressed Secret Key Agreement: Maximizing Multivariate Mutual Information per Bit. Entropy 19(10): 545 (2017) - [c28]Chung Chan, Manuj Mukherjee, Navin Kashyap, Qiaoqiao Zhou:
Secret key agreement under discussion rate constraints. ISIT 2017: 1519-1523 - [c27]Chung Chan, Ali Al-Bashabsheh, Qiaoqiao Zhou:
Info-clustering: An efficient algorithm by network information flow. ITA 2017: 1-10 - [i16]Chung Chan, Ali Al-Bashabsheh, Qiaoqiao Zhou:
Agglomerative Info-Clustering. CoRR abs/1701.04926 (2017) - [i15]Chung Chan, Manuj Mukherjee, Navin Kashyap, Qiaoqiao Zhou:
Secret Key Agreement under Discussion Rate Constraints. CoRR abs/1701.05008 (2017) - [i14]Chung Chan, Ali Al-Bashabsheh, Qiaoqiao Zhou:
Info-Clustering: An Efficient Algorithm by Network Information Flow. CoRR abs/1702.00109 (2017) - [i13]Chung Chan, Manuj Mukherjee, Navin Kashyap, Qiaoqiao Zhou:
On the Optimality of Secret Key Agreement via Omniscience. CoRR abs/1702.07429 (2017) - [i12]Chung Chan:
Compressed Secret Key Agreement: Maximizing Multivariate Mutual Information Per Bit. CoRR abs/1706.04295 (2017) - 2016
- [j7]Fanggang Wang, Octavia A. Dobre, Chung Chan, Jingwen Zhang:
Fold-based Kolmogorov-Smirnov Modulation Classifier. IEEE Signal Process. Lett. 23(7): 1003-1007 (2016) - [j6]Chung Chan, Ali Al-Bashabsheh, Qiaoqiao Zhou, Ni Ding, Tie Liu, Alex Sprintson:
Successive Omniscience. IEEE Trans. Inf. Theory 62(6): 3270-3289 (2016) - [j5]Chung Chan, Ali Al-Bashabsheh, Qiaoqiao Zhou, Tarik Kaced, Tie Liu:
Info-Clustering: A Mathematical Theory for Data Clustering. IEEE Trans. Mol. Biol. Multi Scale Commun. 2(1): 64-91 (2016) - [c26]Chung Chan, Ali Al-Bashabsheh, Qiaoqiao Zhou, Tie Liu:
Duality between feature selection and data clustering. Allerton 2016: 142-147 - [c25]Ni Ding, Chung Chan, Tie Liu, Rodney A. Kennedy, Parastoo Sadeghi:
A game-theoretic perspective on communication for omniscience. AusCTW 2016: 95-100 - [c24]Ni Ding, Chung Chan, Qiaoqiao Zhou, Rodney A. Kennedy, Parastoo Sadeghi:
A Faster Algorithm for Asymptotic Communication for Omniscience. GLOBECOM Workshops 2016: 1-6 - [c23]Ni Ding, Chung Chan, Qiaoqiao Zhou, Rodney A. Kennedy, Parastoo Sadeghi:
Fairness in communication for omniscience. ISIT 2016: 2314-2318 - [c22]Manuj Mukherjee, Chung Chan, Navin Kashyap, Qiaoqiao Zhou:
Bounds on the communication rate needed to achieve SK capacity in the hypergraphical source model. ISIT 2016: 2504-2508 - [c21]Chung Chan, Ali Al-Bashabsheh, Qiaoqiao Zhou:
Incremental and decremental secret key agreement. ISIT 2016: 2514-2518 - [c20]Chung Chan, Manuj Mukherjee, Navin Kashyap, Qiaoqiao Zhou:
When is omniscience a rate-optimal strategy for achieving secret key capacity? ITW 2016: 354-358 - [i11]Manuj Mukherjee, Chung Chan, Navin Kashyap, Qiaoqiao Zhou:
Bounds on the Communication Rate Needed to Achieve SK Capacity in the Hypergraphical Source Model. CoRR abs/1601.05377 (2016) - [i10]Ni Ding, Chung Chan, Qiaoqiao Zhou, Rodney A. Kennedy, Parastoo Sadeghi:
Fairness in Communication for Omniscience. CoRR abs/1601.07285 (2016) - [i9]Chung Chan, Ali Al-Bashabsheh, Qiaoqiao Zhou, Tarik Kaced, Tie Liu:
Info-Clustering: A Mathematical Theory for Data Clustering. CoRR abs/1605.01233 (2016) - [i8]Chung Chan, Ali Al-Bashabsheh, Qiaoqiao Zhou:
Incremental and Decremental Secret Key Agreement. CoRR abs/1605.01861 (2016) - [i7]Ni Ding, Chung Chan, Qiaoqiao Zhou, Rodney A. Kennedy, Parastoo Sadeghi:
A Faster Algorithm for Asymptotic Communication for Omniscience. CoRR abs/1607.04819 (2016) - [i6]Chung Chan, Ali Al-Bashabsheh, Qiaoqiao Zhou, Tie Liu:
Duality between Feature Selection and Data Clustering. CoRR abs/1609.08312 (2016) - [i5]Ni Ding, Chung Chan, Qiaoqiao Zhou, Rodney A. Kennedy, Parastoo Sadeghi:
Communication for Omniscience. CoRR abs/1611.08367 (2016) - 2015
- [j4]Chung Chan, Ali Al-Bashabsheh, Javad B. Ebrahimi, Tarik Kaced, Tie Liu:
Multivariate Mutual Information Inspired by Secret-Key Agreement. Proc. IEEE 103(10): 1883-1913 (2015) - [c19]Chung Chan, Tie Liu:
Clustering by multivariate mutual information under Chow-Liu tree approximation. Allerton 2015: 993-999 - [c18]Chung Chan, Ali Al-Bashabsheh, Javad B. Ebrahimi, Tarik Kaced, Swanand Kadhe, Tie Liu, Alex Sprintson, Muxi Yan, Qiaoqiao Zhou:
Successive omniscience. NetCod 2015: 21-25 - [i4]Ni Ding, Chung Chan, Tie Liu, Rodney A. Kennedy, Parastoo Sadeghi:
A Game-theoretic Perspective on Communication for Omniscience. CoRR abs/1510.08953 (2015) - 2014
- [j3]Chung Chan, Lizhong Zheng:
Multiterminal Secret Key Agreement. IEEE Trans. Inf. Theory 60(6): 3379-3412 (2014) - [j2]Chung Chan, Roger R. Fulton, Robert Barnett, David Dagan Feng, Steven R. Meikle:
Postreconstruction Nonlocal Means Filtering of Whole-Body PET With an Anatomical Prior. IEEE Trans. Medical Imaging 33(3): 636-650 (2014) - [c17]Pak Hou Che, Mayank Bakshi, Chung Chan, Sidharth Jaggi:
Reliable, deniable and hidable communication. ITA 2014: 1-10 - [c16]Pak Hou Che, Mayank Bakshi, Chung Chan, Sidharth Jaggi:
Reliable deniable communication with channel uncertainty. ITW 2014: 30-34 - [c15]Pak Hou Che, Swanand Kadhe, Mayank Bakshi, Chung Chan, Sidharth Jaggi, Alex Sprintson:
Reliable, deniable and hidable communication: A quick survey. ITW 2014: 227-231 - 2013
- [j1]Qifu Tyler Sun, Shuo-Yen Robert Li, Chung Chan:
Matroidal Characterization of Optimal Linear Network Codes over Cyclic Networks. IEEE Commun. Lett. 17(10): 1992-1995 (2013) - [c14]Chung Chan:
Cyclic linking network. ISIT 2013: 789-793 - [c13]Chung Chan, Kenneth W. Shum, Qifu Tyler Sun:
Combinatorial flow over cyclic linear networks. ITW 2013: 1-5 - [c12]Chun Meng, Hulya Seferoglu, Athina Markopoulou, Kenneth W. Shum, Chung Chan:
Multicast packing for coding across multiple unicasts. NetCod 2013: 1-6 - 2012
- [c11]Fanggang Wang, Chung Chan:
Variational-distance-based modulation classifier. ICC 2012: 5635-5639 - [c10]Chung Chan:
Matroidal undirected network. ISIT 2012: 1498-1502 - [c9]Chung Chan:
Agreement of a restricted secret key. ISIT 2012: 1782-1786 - [c8]Chung Chan:
From secret key agreement to matroidal undirected network. ITA 2012: 281-290 - [c7]Chung Chan:
Universal secure network coding by non-linear secret key agreement. NetCod 2012: 97-102 - 2011
- [c6]Chung Chan:
Multiterminal secure source coding for a common secret source. Allerton 2011: 188-195 - [c5]Chung Chan:
Delay of linear perfect secret key agreement. Allerton 2011: 1128-1135 - [c4]Cherry G. Ballangan, Chung Chan, Xiuying Wang, David Dagan Feng:
The impact of reconstruction algorithms on semi-automatic small lesion segmentation for PET: A phantom study. EMBC 2011: 8483-8436 - [c3]Chung Chan:
The hidden flow of information. ISIT 2011: 978-982 - [c2]Chung Chan:
Linear perfect secret key agreement. ITW 2011: 723-726 - [i3]Feng Liu, Chung Chan, Ying Jun Zhang:
On the Degree of Freedom for Multi-Source Multi-Destination Wireless Network with Multi-layer Relays. CoRR abs/1101.2288 (2011) - 2010
- [b1]Chung Chan:
Generating secret in a network. Massachusetts Institute of Technology, Cambridge, MA, USA, 2010 - [c1]Chung Chan, Lizhong Zheng:
Mutual dependence for secret key agreement. CISS 2010: 1-6
2000 – 2009
- 2008
- [i2]Chung Chan:
On Tightness of Mutual Dependence Upperbound for Secret-key Capacity of Multiple Terminals. CoRR abs/0805.3200 (2008) - [i1]Chung Chan:
Success Exponent of Wiretapper: A Tradeoff between Secrecy and Reliability. CoRR abs/0805.3605 (2008)
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 2025-03-14 17:46 CET 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:
