Travelled to:1 × Australia
1 × China
2 × USA
Collaborated with:A.G.Gray P.Ram A.J.Connolly B.Xiao S.Tharakan C.D.Yu G.Biros R.R.Curtin D.V.Anderson C.L.Isbell
Talks about:algorithm (3) tree (3) fast (2) comprehens (1) euclidean (1) independ (1) approxim (1) treecod (1) minimum (1) analysi (1)
Person: William B. March
DBLP: March:William_B=
Contributed to:
2015
201320122010Wrote 4 papers:
- KDD-2015-MarchXTYB #approximate #kernel #robust
- Robust Treecode Approximation for Kernel Machines (WBM, BX, ST, CDY, GB), pp. 775–784.
- ICML-c3-2013-CurtinMRAGI #algorithm #independence
- Tree-Independent Dual-Tree Algorithms (RRC, WBM, PR, DVA, AGG, CLI), pp. 1435–1443.
- KDD-2012-MarchCG #algorithm #correlation #performance
- Fast algorithms for comprehensive n-point correlation estimates (WBM, AJC, AGG), pp. 1478–1486.
- KDD-2010-MarchRG #algorithm #analysis #performance
- Fast euclidean minimum spanning tree: algorithm, analysis, and applications (WBM, PR, AGG), pp. 603–612.