Titlebook: Similarity Search and Applications; 9th International Co Laurent Amsaleg,Michael E. Houle,Erich Schubert Conference proceedings 2016 Spring

coerce

书目名称Similarity Search and Applications影响因子(影响力)




书目名称Similarity Search and Applications影响因子(影响力)学科排名




书目名称Similarity Search and Applications网络公开度




书目名称Similarity Search and Applications网络公开度学科排名




书目名称Similarity Search and Applications被引频次




书目名称Similarity Search and Applications被引频次学科排名




书目名称Similarity Search and Applications年度引用




书目名称Similarity Search and Applications年度引用学科排名




书目名称Similarity Search and Applications读者反馈




书目名称Similarity Search and Applications读者反馈学科排名

inflate

Pruned Bi-directed K-nearest Neighbor Graph for Proximity Searchse the k-nearest neighbor graph (KNNG) as an index perform better than tree-based and hash-based methods in terms of search precision and query time. To further improve the performance of the KNNG, the number of edges should be increased. However, increasing the number takes up more memory, while th

INERT

aspect

偏见

尊重

Quantifying the Invariance and Robustness of Permutation-Based Indexing Schemesays of large-scale Information Systems. Similarity search, requiring to resolve nearest neighbor (NN) searches, is a fundamental tool for structuring information space. Permutation-based Indexing (PBI) is a reference-based indexing scheme that accelerates NN search by combining the use of landmark p

peritonitis

Deep Permutations: Deep Convolutional Neural Networks and Permutation-Based Indexingic visual similarity search tasks..Recently scientists have shown that permutation-based methods offer very good performance in indexing and supporting approximate similarity search on large database of objects. Permutation-based approaches represent metric objects as sequences (permutations) of ref

比赛用背带

Patch Matching with Polynomial Exponential Families and Projective Divergencesal task that is time consuming, specially when zoom factors and symmetries are handled. The matching results heavily depend on the underlying notion of distances, or similarities, between patches. We present a method that consists in modeling patches by flexible statistical parametric distributions

capsule

Known-Item Search in Video Databases with Textual Queries objects to be labeled with an arbitrary ImageNet classification model. During the search, the set of query words is expanded with synonyms and hypernyms until we encounter words present in the database which are consequently searched for. In the second approach, we delegate the query to an independ

PANEL