default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAolin Xu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c11]Chenran Li, Aolin Xu, Enna Sachdeva, Teruhisa Misu, Behzad Dariush:
Optimal Driver Warning Generation in Dynamic Driving Environment. ICRA 2024: 14184-14190- 2023
- [i9]Aolin Xu, Peng Guan:
Bayesian Learning for Dynamic Inference. CoRR abs/2301.00032 (2023) - 2022
- [j4]Aolin Xu, Maxim Raginsky
:
Minimum Excess Risk in Bayesian Learning. IEEE Trans. Inf. Theory 68(12): 7935-7955 (2022) - 2021
- [i8]Aolin Xu:
Anytime Decoding by Monte-Carlo Tree Search. CoRR abs/2105.00056 (2021) - [i7]Aolin Xu:
Dynamic Inference. CoRR abs/2111.14746 (2021) - 2020
- [c10]Aolin Xu, Todd Coleman:
Minimax Lower Bounds for Circular Source Localization. ISIT 2020: 1242-1247 - [c9]Aolin Xu:
Continuity of Generalized Entropy. ISIT 2020: 2246-2251 - [i6]Aolin Xu, Maxim Raginsky:
Minimum Excess Risk in Bayesian Learning. CoRR abs/2012.14868 (2020) - [i5]Aolin Xu:
Continuity of Generalized Entropy and Statistical Learning. CoRR abs/2012.15829 (2020)
2010 – 2019
- 2017
- [j3]Aolin Xu, Maxim Raginsky:
Information-Theoretic Lower Bounds on Bayes Risk in Decentralized Estimation. IEEE Trans. Inf. Theory 63(3): 1580-1600 (2017) - [j2]Aolin Xu, Maxim Raginsky:
Information-Theoretic Lower Bounds for Distributed Function Computation. IEEE Trans. Inf. Theory 63(4): 2314-2337 (2017) - [c8]Aolin Xu, Maxim Raginsky:
Information-theoretic analysis of generalization capability of learning algorithms. NIPS 2017: 2524-2533 - [i4]Aolin Xu, Maxim Raginsky:
Information-theoretic analysis of generalization capability of learning algorithms. CoRR abs/1705.07809 (2017) - 2016
- [b1]Aolin Xu:
Information-theoretic limitations of distributed information processing. University of Illinois Urbana-Champaign, USA, 2016 - [j1]Yingyan Lin, Min-Sun Keel, Adam C. Faust, Aolin Xu, Naresh R. Shanbhag, Elyse Rosenbaum, Andrew C. Singer:
A Study of BER-Optimal ADC-Based Receiver for Serial Links. IEEE Trans. Circuits Syst. I Regul. Pap. 63-I(5): 693-704 (2016) - [c7]Maxim Raginsky, Alexander Rakhlin, Matthew Tsao, Yihong Wu, Aolin Xu:
Information-theoretic analysis of stability and bias of learning algorithms. ITW 2016: 26-30 - [i3]Aolin Xu, Maxim Raginsky:
Information-Theoretic Lower Bounds on Bayes Risk in Decentralized Estimation. CoRR abs/1607.00550 (2016) - 2015
- [c6]Aolin Xu, Maxim Raginsky:
Converses for distributed estimation via strong data processing inequalities. ISIT 2015: 2376-2380 - [i2]Aolin Xu, Maxim Raginsky:
Converses for distributed estimation via strong data processing inequalities. CoRR abs/1504.06028 (2015) - [i1]Aolin Xu, Maxim Raginsky:
Information-theoretic lower bounds for distributed function computation. CoRR abs/1509.00514 (2015) - 2014
- [c5]Aolin Xu, Maxim Raginsky:
A new information-theoretic lower bound for distributed function computation. ISIT 2014: 2227-2231 - 2012
- [c4]Peter Kairouz, Aolin Xu, Naresh R. Shanbhag, Andrew C. Singer:
A sphere decoding approach for the vector Viterbi algorithm. ACSCC 2012: 114-118 - [c3]Aadithya V. Karthik, Yingyan Lin, Chenjie Gu, Aolin Xu, Jaijeet S. Roychowdhury, Naresh R. Shanbhag:
A fully automated technique for constructing FSM abstractions of non-ideal latches in communication systems. ICASSP 2012: 5289-5292 - 2010
- [c2]Aolin Xu, Qicun Shi, Zhixing Yang, Kewu Peng, Jian Song:
Spectrum Sensing for DTMB System Based on PN Cross-Correlation. ICC 2010: 1-5
2000 – 2009
- 2009
- [c1]Aolin Xu, Kewu Peng, Zhixing Yang:
Joint Synchronization Using Cyclic Property. ICC 2009: 1-5
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-20 20:30 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:
