default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAli Al-Bashabsheh
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j12]Chao Zhao
, Ali Al-Bashabsheh, Chung Chan:
Game Theoretic Clustering for Finding Strong Communities. Entropy 26(3): 268 (2024)- 2023
- [j11]Xu Wang, Ali Al-Bashabsheh, Chao Zhao, Chung Chan:
Smoothed noise contrastive mutual information neural estimation. J. Frankl. Inst. 360(16): 12415-12435 (2023) - [j10]Masoumeh Soflaei, Richong Zhang, Hongyu Guo, Ali Al-Bashabsheh, Yongyi Mao:
Information Bottleneck and Aggregated Learning. IEEE Trans. Pattern Anal. Mach. Intell. 45(12): 14807-14820 (2023) - 2022
- [c18]Xu Wang, Ali Al-Bashabsheh, Chao Zhao, Chung Chan:
Smoothed InfoNCE: Breaking the log N Curse without Overshooting. ISIT 2022: 724-729 - 2021
- [j9]Chung Chan, Ali Al-Bashabsheh, Qiaoqiao Zhou:
Agglomerative Info-Clustering: Maximizing Normalized Total Correlation. IEEE Trans. Inf. Theory 67(3): 2001-2011 (2021) - [c17]Xu Wang, Ali Al-Bashabsheh, Chao Zhao, Chung Chan:
Adaptive Label Smoothing for Classifier-based Mutual Information Neural Estimation. ISIT 2021: 1035-1040 - 2020
- [c16]Masoumeh Soflaei, Hongyu Guo, Ali Al-Bashabsheh, Yongyi Mao, Richong Zhang:
Aggregated Learning: A Vector-Quantization Approach to Learning Neural Network Classifiers. AAAI 2020: 5810-5817 - [c15]Bernhard C. Geiger, Ali Al-Bashabsheh:
On Functions of Markov Random Fields. ITW 2020: 1-5 - [i17]Masoumeh Soflaei, Hongyu Guo, Ali Al-Bashabsheh, Yongyi Mao, Richong Zhang:
Aggregated Learning: A Vector-Quantization Approach to Learning Neural Network Classifiers. CoRR abs/2001.03955 (2020) - [i16]Bernhard C. Geiger, Ali Al-Bashabsheh:
On Functions of Markov Random Fields. CoRR abs/2005.13908 (2020)
2010 – 2019
- 2019
- [j8]Raymond W. Yeung, Ali Al-Bashabsheh, Chao Chen, Qi Chen, Pierre Moulin:
On Information-Theoretic Characterizations of Markov Random Fields and Subfields. IEEE Trans. Inf. Theory 65(3): 1493-1511 (2019) - [c14]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 - [i15]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) - 2018
- [j7]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) - [j6]Ali Al-Bashabsheh, Pascal O. Vontobel:
A Factor-Graph Approach to Algebraic Topology, With Applications to Kramers-Wannier Duality. IEEE Trans. Inf. Theory 64(12): 7488-7510 (2018) - [c13]Chung Chan, Ali Al-Bashabsheh, Qiaoqiao Zhou:
Agglomerative Info-Clustering. ISIT 2018: 1725-1729 - 2017
- [c12]Raymond W. Yeung, Ali Al-Bashabsheh, Chao Chen, Qi Chen, Pierre Moulin:
Information-theoretic characterizations of Markov random fields and subfields. ISIT 2017: 3040-3044 - [c11]Chung Chan, Ali Al-Bashabsheh, Qiaoqiao Zhou:
Info-clustering: An efficient algorithm by network information flow. ITA 2017: 1-10 - [i14]Chung Chan, Ali Al-Bashabsheh, Qiaoqiao Zhou:
Agglomerative Info-Clustering. CoRR abs/1701.04926 (2017) - [i13]Chung Chan, Ali Al-Bashabsheh, Qiaoqiao Zhou:
Info-Clustering: An Efficient Algorithm by Network Information Flow. CoRR abs/1702.00109 (2017) - 2016
- [j5]Chung Chan, Ali Al-Bashabsheh, Qiaoqiao Zhou, Ni Ding, Tie Liu, Alex Sprintson:
Successive Omniscience. IEEE Trans. Inf. Theory 62(6): 3270-3289 (2016) - [j4]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) - [c10]Chung Chan, Ali Al-Bashabsheh, Qiaoqiao Zhou, Tie Liu:
Duality between feature selection and data clustering. Allerton 2016: 142-147 - [c9]Chung Chan, Ali Al-Bashabsheh, Qiaoqiao Zhou:
Incremental and decremental secret key agreement. ISIT 2016: 2514-2518 - [i12]Chung Chan, Ali Al-Bashabsheh, Qiaoqiao Zhou, Tarik Kaced, Tie Liu:
Info-Clustering: A Mathematical Theory for Data Clustering. CoRR abs/1605.01233 (2016) - [i11]Chung Chan, Ali Al-Bashabsheh, Qiaoqiao Zhou:
Incremental and Decremental Secret Key Agreement. CoRR abs/1605.01861 (2016) - [i10]Ali Al-Bashabsheh, Pascal O. Vontobel:
Kramers-Wannier Duality and Factor Graphs. CoRR abs/1607.02361 (2016) - [i9]Raymond W. Yeung, Ali Al-Bashabsheh, Chao Chen, Qi Chen, Pierre Moulin:
On Characterizations of Markov Random Fields and Subfields. CoRR abs/1608.03697 (2016) - [i8]Chung Chan, Ali Al-Bashabsheh, Qiaoqiao Zhou, Tie Liu:
Duality between Feature Selection and Data Clustering. CoRR abs/1609.08312 (2016) - 2015
- [j3]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) - [c8]Ali Al-Bashabsheh, Pascal O. Vontobel:
The ising model: Kramers-Wannier duality and normal factor graphs. ISIT 2015: 2266-2270 - [c7]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 - 2014
- [c6]Ali Al-Bashabsheh, Yongyi Mao:
On stochastic estimation of the partition function. ISIT 2014: 1504-1508 - [i7]Ali Al-Bashabsheh, Yongyi Mao:
On Stochastic Estimation of Partition Function. CoRR abs/1401.7273 (2014) - 2013
- [c5]Ali Al-Bashabsheh, Yongyi Mao, Terence H. Chan:
Translation schemes and LP bounds. CWIT 2013: 200-204 - 2012
- [i6]Ali Al-Bashabsheh, Yongyi Mao:
Normal Factor Graphs as Probabilistic Models. CoRR abs/1209.3300 (2012) - 2011
- [j2]Ali Al-Bashabsheh, Yongyi Mao:
Normal Factor Graphs and Holographic Transformations. IEEE Trans. Inf. Theory 57(2): 752-763 (2011) - [c4]Ali Al-Bashabsheh, Yongyi Mao, Pascal O. Vontobel:
Normal factor graphs: A diagrammatic approach to linear algebra. ISIT 2011: 2178-2182 - [i5]Ali Al-Bashabsheh, Yongyi Mao, Pascal O. Vontobel:
Normal Factor Graphs: A Diagrammatic Approach to Linear Algebra. CoRR abs/1102.5755 (2011) - 2010
- [c3]Ali Al-Bashabsheh, Yongyi Mao:
Valiant transform of forney graphs. ITW 2010: 1-5 - [i4]Ali Al-Bashabsheh, Yongyi Mao:
Valiant Transform of Forney Graphs. CoRR abs/1004.3833 (2010) - [i3]Ali Al-Bashabsheh, Yongyi Mao, Abbas Yongaçoglu:
On Holant Theorem and Its Proof. CoRR abs/1005.1349 (2010)
2000 – 2009
- 2008
- [j1]Ali Al-Bashabsheh, Abbas Yongaçoglu:
Average Throughput with Linear Network Coding over Finite Fields: The Combination Network Case. EURASIP J. Wirel. Commun. Netw. 2008 (2008) - [c2]Ali Al-Bashabsheh, Abbas Yongaçoglu:
On the k-pairs problem. ISIT 2008: 1828-1832 - [i2]Ali Al-Bashabsheh, Abbas Yongaçoglu:
On the Capacity Bounds of Undirected Networks. CoRR abs/0804.4455 (2008) - [i1]Ali Al-Bashabsheh, Abbas Yongaçoglu:
On the k-pairs problem. CoRR abs/0805.0050 (2008) - 2007
- [c1]Ali Al-Bashabsheh, Abbas Yongaçoglu:
On the Capacity Bounds of Undirected Networks. ISIT 2007: 126-130
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-08-05 20:25 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:
