申请试用
HOT
登录
注册
 
Data-dependent Hashing for Nearest Neighbor Search - MIT
1 / 43

Data-dependent Hashing for Nearest Neighbor Search - MIT

Vivek
/
发布于
7年前
/
1890
人观看
Plan. 7. Space decompositions; Structure in data. PCA-tree. No structure in data. Data-dependent hashing. Towards practice. It's all about space decompositions.
1点赞
0收藏
0下载