Neural Information Processing Systems / MIT Press / /
Country
United States / / /
Facility
library MLPACK / Carnegie Mellon University / Jr. Georgia Institute of Technology / /
IndustryTerm
large-scale machine learning applications / range search implementations / dual-tree k-nearest neighbor search / branchand-bound algorithm / branch-and-bound algorithms / dual-tree branch-and-bound algorithms / parallel dual-tree algorithms / dual-tree algorithms / distributed dual-tree algorithm / binary search trees / range search / standalone algorithms / meta-algorithm / data mining / then use branch-and-bound algorithms / signal processing / k-nearest neighbor search / bound algorithm / immediate applications / correct dual-tree algorithm / given algorithms / dual-tree algorithm / meta-algorithms / give algorithms / large-scale distributed dual-tree algorithms / quadratically-scaling brute-force algorithm / example dual-tree algorithms / furthest-neighbor search / algorithms / geographic information systems / nearest neighbor search / /
Organization
MIT / Nuclear Regulatory Commission / Georgia Institute of Technology / Carnegie Mellon University / /
Person
Nq / Nc / Tq / David V. Anderson Alexander / Hart / Alex Gray / Alexander G. Gray Charles / max B / William B. March Parikshit Ram David V / Nd / Ryan R. Curtin William / /
Position
VP / researcher / author / /
Product
Sigma DP1 Digital Camera / /
ProgrammingLanguage
C++ / /
ProvinceOrState
Georgia / Massachusetts / /
PublishedMedium
Machine Learning / Communications of the ACM / /
Technology
give algorithms / large-scale distributed dual-tree algorithms / 30332 USA Abstract Dual-tree algorithms / given algorithms / dual-tree branch-and-bound algorithms / branchand-bound algorithm / R.A. An algorithm / machine learning / provably correct dual-tree algorithm / A.G. Linear-time algorithms / five example dual-tree algorithms / two algorithms / parallel dual-tree algorithms / distributed dual-tree algorithm / artificial intelligence / standalone algorithms / dual-tree algorithm / entirely separate algorithms / five separate algorithms / then use branch-and-bound algorithms / Data Mining / tree-based algorithms / dual-tree algorithms / quadratically-scaling brute-force algorithm / branch-and-bound algorithms / be found quickly using tree-based algorithms / /
Tree-Independent Dual-Tree Algorithms Ryan R. Curtin William B. March Parikshit Ram David V. Anderson Alexander G. Gray