![](https://www.pdfsearch.io/img/4c3349d7a43af10e26c715f09f137dff.jpg)
| Document Date: 2014-11-05 11:09:22 Open Document File Size: 196,33 KBShare Result on Facebook
City Dempster / Kernel / / Company B AB / IMH / YouTube / R H AB . / / / Event Product Recall / Product Issues / / Facility Cun Mu‡ Sanjiv Kumar Shih-Fu Chang‡ IBM T. J. Watson Research Center / / IndustryTerm search recall / higher search accuracy / closed-form optimal solution / inner-product operator / continuous solutions / analytical solution / inadequate search performance / polynomial-time algorithm / tractable optimization algorithm / similarity search / majorization-minimization algorithm / search performance / maximization algorithm / approximate solution / search accuracy / large-scale similarity search experiments / tractable alternating maximization algorithm / closed-form solution / em algorithm / Near-optimal hashing algorithms / constant-time nearest neighbor search / search procedures / search efficiency / nearest neighbor search / alternating maximization algorithm / / NaturalFeature DGH falls / / Organization Columbia University / Royal Statistical Society / BRE DGH / Wei Liu† Cun Mu‡ Sanjiv Kumar Shih-Fu Chang‡ IBM T. J. Watson Research Center / / Person max b / Wei Liu† Cun Mu / M. Norouzi / Shih-Fu Chang / Sanjiv Kumar Shih-Fu / / Position D. J. / Prime Minister / tackle / / Product zero / search / results / Precision / Top-2K TrainTime TestTime r / search performance / particularly low recall / / ProgrammingLanguage R / / ProvinceOrState New Mexico / / PublishedMedium Journal of the ACM / Journal of the Royal Statistical Society / Communications of the ACM / / Technology alternating maximization algorithm / majorization-minimization algorithm / DGH algorithm / machine learning / EM algorithm / tractable alternating maximization algorithm / alternating algorithm / 3.3 DGH Algorithm / 4 Algorithm / Hashing algorithms / polynomial-time algorithm / 3 Algorithm / computationally tractable optimization algorithm / / |