default search action
William B. March
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
- [c10]Chenhan D. Yu, William B. March, George Biros:
An N log N Parallel Fast Direct Solver for Kernel Matrices. IPDPS 2017: 886-896 - [i7]Chenhan D. Yu, William B. March, George Biros:
An N log N Parallel Fast Direct Solver for Kernel Matrices. CoRR abs/1701.02324 (2017) - 2016
- [j4]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) - [c9]Chenhan D. Yu, William B. March, Bo Xiao, George Biros:
INV-ASKIT: A Parallel Fast Direct Solver for Kernel Matrices. IPDPS 2016: 161-171 - [i6]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
- [j3]Ryan R. Curtin, Dongryeol Lee, William B. March, Parikshit Ram:
Plug-and-play dual-tree algorithm runtime analysis. J. Mach. Learn. Res. 16: 3269-3297 (2015) - [j2]William B. March, Bo Xiao, George Biros:
ASKIT: Approximate Skeletonization Kernel-Independent Treecode in High Dimensions. SIAM J. Sci. Comput. 37(2) (2015) - [c8]William B. March, Bo Xiao, Chenhan D. Yu, George Biros:
An Algebraic Parallel Treecode in Arbitrary Dimensions. IPDPS 2015: 571-580 - [c7]William B. March, Bo Xiao, Sameer Tharakan, Chenhan D. Yu, George Biros:
Robust Treecode Approximation for Kernel Machines. KDD 2015: 775-784 - [c6]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 - [i5]Ryan R. Curtin, Dongryeol Lee, William B. March, Parikshit Ram:
Plug-and-play dual-tree algorithm runtime analysis. CoRR abs/1501.05222 (2015) - 2014
- [i4]William B. March, George Biros:
Far-Field Compression for Fast Kernel Summation Methods in High Dimensions. CoRR abs/1409.2802 (2014) - [i3]William B. March, Bo Xiao, George Biros:
ASKIT: Approximate Skeletonization Kernel-Independent Treecode in High Dimensions. CoRR abs/1410.0260 (2014) - 2013
- [b1]William B. March:
Multi-tree algorithms for computational statistics and phyiscs. Georgia Institute of Technology, Atlanta, GA, USA, 2013 - [j1]Ryan R. Curtin, James R. Cline, N. P. Slagle, William B. March, Parikshit Ram, Nishant A. Mehta, Alexander G. Gray:
MLPACK: a scalable C++ machine learning library. J. Mach. Learn. Res. 14(1): 801-805 (2013) - [c5]Ryan R. Curtin, William B. March, Parikshit Ram, David V. Anderson, Alexander G. Gray, Charles L. Isbell Jr.:
Tree-Independent Dual-Tree Algorithms. ICML (3) 2013: 1435-1443 - [i2]Ryan R. Curtin, William B. March, Parikshit Ram, David V. Anderson, Alexander G. Gray, Charles Lee Isbell Jr.:
Tree-Independent Dual-Tree Algorithms. CoRR abs/1304.4327 (2013) - 2012
- [c4]William B. March, Andrew J. Connolly
, Alexander G. Gray:
Fast algorithms for comprehensive n-point correlation estimates. KDD 2012: 1478-1486 - [c3]William B. March, Kenneth Czechowski, Marat Dukhan, Thomas Benson, Dongryeol Lee, Andrew J. Connolly
Optimizing the computation of n-point correlations on large-scale astronomical data. SC 2012: 74 - [i1]Ryan R. Curtin, James R. Cline, N. P. Slagle, William B. March, Parikshit Ram, Nishant A. Mehta, Alexander G. Gray:
MLPACK: A Scalable C++ Machine Learning Library. CoRR abs/1210.6293 (2012) - 2010
- [c2]William B. March, Parikshit Ram, Alexander G. Gray:
Fast euclidean minimum spanning tree: algorithm, analysis, and applications. KDD 2010: 603-612
2000 – 2009
- 2009
- [c1]Parikshit Ram, Dongryeol Lee, William B. March, Alexander G. Gray:
Linear-time Algorithms for Pairwise Statistical Problems. NIPS 2009: 1527-1535
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-11 21:28 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: