Rectangle Inequalities for Data structure lower Bounds Yitong Yin Nanjing University Nexus of Information and Computation Theories Fundamental Inequalities and Lower Bounds Theme Institut Henri Poincare
Rectangle Inequalities for Data Structure Lower Bounds Yitong Yin Nanjing University Nexus of Information and Computation Theories Fundamental Inequalities and Lower Bounds Theme @ Institut Henri Poincaré
Online Note "Yitong Yin:Simple average-case lower bounds for approximate near-neighbor from isoperimetric inequalities." http://arxiv.org/abs/1602.05391
Online Note http://arxiv.org/abs/1602.05391 “Yitong Yin: Simple average-case lower bounds for approximate near-neighbor from isoperimetric inequalities
Nearest Neighbor Search (NNS) metric space (,dist)
Nearest Neighbor Search metric space (X,dist) (NNS)
Nearest Neighbor Search (NNS) metric space (X,dist) database y=(y1,y2,.,yn)∈Xn
Nearest Neighbor Search metric space (X,dist) database y = (y1, y2,...,yn) 2 Xn (NNS)
Nearest Neighbor Search (NNS) metric space (X,dist) database y=(y1,y2,·,yn)∈Xn data structure 3 7 preprocessing 122
Nearest Neighbor Search metric space (X,dist) database y = (y1, y2,...,yn) 2 Xn preprocessing data structure (NNS)