default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBo Xiao 0001
Person information
- affiliation: University of Texas at Austin, Austin, TX
- affiliation (PhD 2015): Georgia Institute of Technology, Atlanta, GA, USA
Other persons with the same name
- Bo Xiao (aka: Xiao Bo) — disambiguation page
- Bo Xiao 0002
![[0000-0001-9361-4340]](https://dblp.uni-trier.de./img/orcid-mark.12x12.png "0000-0001-9361-4340")
— King's College London, United Kingdom (and 1 more) - Bo Xiao 0003 — University of Southern California, Department of Electrical Engineering, Los Angeles, CA, USA
- Bo Xiao 0004 (aka: Xiao Bo 0004) — East China Normal University, MOE Engineering Research Center for Software/Hardware Co-Design Technology and Application, Shanghai, China (and 1 more)
- Bo Xiao 0005 — Tongji University, Key Laboratory of Embedded System and Service Computing, Shanghai, China
- Bo Xiao 0006 — Beijing University of Posts and Telecommunications, School of Information and Communication Engineering, China (and 1 more)
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2016
[j3]William B. March, Bo Xiao, Chenhan D. Yu, George Biros:
ASKIT: An Efficient, Parallel Library for High-Dimensional Kernel Summations. SIAM J. Sci. Comput. 38(5) (2016)- [j2]Bo Xiao, George Biros:
Parallel Algorithms for Nearest Neighbor Search Problems in High Dimensions. SIAM J. Sci. Comput. 38(5) (2016) - [c6]Chenhan D. Yu, William B. March, Bo Xiao, George Biros:
INV-ASKIT: A Parallel Fast Direct Solver for Kernel Matrices. IPDPS 2016: 161-171 - [i2]Chenhan D. Yu, William B. March, Bo Xiao, George Biros:
Inv-ASKIT: A Parallel Fast Diret Solver for Kernel Matrices. CoRR abs/1602.01376 (2016) - 2015
- [b1]Bo Xiao:
Parallel algorithms for generalized N-body problem in high dimensions and their applications for bayesian inference and image analysis. Georgia Institute of Technology, Atlanta, GA, USA, 2015 - [j1]William B. March, Bo Xiao, George Biros:
ASKIT: Approximate Skeletonization Kernel-Independent Treecode in High Dimensions. SIAM J. Sci. Comput. 37(2) (2015) - [c5]William B. March, Bo Xiao, Chenhan D. Yu, George Biros:
An Algebraic Parallel Treecode in Arbitrary Dimensions. IPDPS 2015: 571-580 - [c4]William B. March, Bo Xiao, Sameer Tharakan, Chenhan D. Yu, George Biros:
Robust Treecode Approximation for Kernel Machines. KDD 2015: 775-784 - [c3]Chenhan D. Yu, Jianyu Huang, Woody Austin, Bo Xiao, George Biros:
Performance optimization for the k-nearest neighbors kernel on x86 architectures. SC 2015: 7:1-7:12 - [c2]William B. March, Bo Xiao, Sameer Tharakan, Chenhan D. Yu, George Biros:
A kernel-independent FMM in general dimensions. SC 2015: 24:1-24:12 - 2014
- [i1]William B. March, Bo Xiao, George Biros:
ASKIT: Approximate Skeletonization Kernel-Independent Treecode in High Dimensions. CoRR abs/1410.0260 (2014) - 2011
- [c1]Logan Moon, Daniel Long, Shreyas Joshi, Vyomkesh Tripathi, Bo Xiao, George Biros:
Poster: parallel algorithms for clustering and nearest neighbor search problems in high dimensions. SC Companion 2011: 57-58
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-11-21 21:21 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:
