IBM / Cambridge University Press / ACM Press / Lawrence Berkeley National Laboratory / Wellesley-Cambridge Press / /
Country
United States / / /
Facility
Carnegie Mellon University / Robotics Institute / Artificial Intelligence Laboratory Massachusetts Institute of Technology / /
IndustryTerm
navigation systems / conventional partitioning algorithms / conventional k-way clustering algorithms / tree search / correct data association solution / simultaneous solution / large potential search space / polynomial-time solution / graph partitioning algorithm / k-way partitioning algorithm / obvious searching algorithm / k-way algorithms / possible solution / approximate solution / trivial solution / polynomial time data association algorithm / search space / /
MarketIndex
set 200 / /
Organization
Cambridge University / Example Data Association / Single-Cluster Spectral Graph Partitioning / RANSAC SCGP / Massachusetts Institute of Technology / C. Data Association Data association / Robotics Institute / US Federal Reserve / Carnegie Mellon University / Pittsburgh / Data Association / Data Association Data association / Pattern Analysis and Machine Intelligence / /
Person
Ai / Matthew Walter / Edwin Olson / Seth Teller / John Leonard / /
Position
teller / /
ProvinceOrState
Pennsylvania / /
PublishedMedium
IEEE Transactions on Pattern Analysis and Machine Intelligence / Lecture Notes in Computer Science / /
Technology
Av / polynomial time data association algorithm / SCGP algorithm / conventional partitioning algorithms / GPS / graph partitioning algorithm / laser / knowledge management / Power Method-style algorithms / SCGP-based SLAM algorithm / obvious searching algorithm / Hough Transform-style algorithm / /
Proc. RSS (Robotics: Science and Systems), Cambridge MA, pp[removed], June[removed]Single-Cluster Spectral Graph Partitioning for Robotics Applications Edwin Olson, Matthew Walter, Seth Teller, and John Leonard Computer S