卡死偷电 发表于 2025-3-25 07:17:49

http://reply.papertrans.cn/87/8675/867402/867402_21.png

Essential 发表于 2025-3-25 10:00:55

0302-9743 ndexing; multimedia; text and document similarity; comparisons and benchmarks; hashing techniques; time-evolving data; and scalable similarity search..978-3-319-46758-0978-3-319-46759-7Series ISSN 0302-9743 Series E-ISSN 1611-3349

N斯巴达人 发表于 2025-3-25 13:13:16

0302-9743 tions, SISAP 2016, held in Tokyo, Japan, in October 2016..The 18 full papers and 7 short papers presented in this volume were carefully reviewed and selected from 47 submissions. The program of the conference was grouped in 8 categories as follows: graphs and networks; metric and permutation-based i

fetter 发表于 2025-3-25 15:58:26

Quantifying the Invariance and Robustness of Permutation-Based Indexing Schemesm is to understand the robustness of the scheme created by modeling and studying by quantifying its invariance properties. After discussing the geometry of PBI, in relation to the study of ranking, from empirical evidence, we make proposals to cater for the inconsistencies of this structure.

macrophage 发表于 2025-3-25 23:25:04

http://reply.papertrans.cn/87/8675/867402/867402_25.png

密切关系 发表于 2025-3-26 00:13:29

Deep Permutations: Deep Convolutional Neural Networks and Permutation-Based Indexing cost, when objects to be indexed are Deep Features. We show that the permutations generated using the proposed method are more effective than those obtained using pivot selection criteria specifically developed for permutation-based methods.

假装是你 发表于 2025-3-26 06:00:35

http://reply.papertrans.cn/87/8675/867402/867402_27.png

PACT 发表于 2025-3-26 09:12:14

Pruned Bi-directed K-nearest Neighbor Graph for Proximity Searchits construction cost is fatally expensive. As an alternative, we show that a graph can be derived from an approximate neighborhood graph, which costs much less to construct than a KNNG, in the same way as the PBKNNG and that it also outperforms a KNNG.

整洁 发表于 2025-3-26 13:29:12

Supermetric Search with the Four-Point Propertyantees. We coin the term . . as, in terms of metric search, they are significantly more tractable. We show some stronger geometric guarantees deriving from the four-point property which can be used in indexing to great effect, and show results for two of the SISAP benchmark searches that are substan

删减 发表于 2025-3-26 20:40:24

http://reply.papertrans.cn/87/8675/867402/867402_30.png
页: 1 2 [3] 4 5 6
查看完整版本: Titlebook: Similarity Search and Applications; 9th International Co Laurent Amsaleg,Michael E. Houle,Erich Schubert Conference proceedings 2016 Spring