找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Similarity Search and Applications; 6th International Co Nieves Brisaboa,Oscar Pedreira,Pavel Zezula Conference proceedings 2013 Springer-V

[复制链接]
楼主: Enkephalin
发表于 2025-3-28 16:31:30 | 显示全部楼层
发表于 2025-3-28 18:55:06 | 显示全部楼层
发表于 2025-3-29 00:55:23 | 显示全部楼层
发表于 2025-3-29 06:43:19 | 显示全部楼层
Machine Learning for Image Classification and Clustering Using a Universal Distance Measurehow different the image is from a set of image prototypes. We use the recently introduced Universal Image Distance (UID) [1] to compare the similarity between an image and a prototype image. The advantage in using the UID is the fact that no domain knowledge nor any image analysis need to be done. E
发表于 2025-3-29 11:17:57 | 显示全部楼层
Faster Algorithms for Tree Similarity Based on Compressed Enumeration of Bounded-Sized Ordered Subtr enumeration algorithms that enumerates all subtrees of an input tree . in the form of their compressed bit signatures. For the task of enumerating all compressed bit signatures of .-subtrees in an ordered tree ., we first present an enumeration algorithm in .(.)-delay, and then, present another enu
发表于 2025-3-29 13:35:26 | 显示全部楼层
Principal Directions-Based Pivot Placemente been introduced in the literature. In this paper, we propose a pivot placement strategy which exploits the natural data orientation in order to select space points which achieve a good alignment with the whole data to be indexed. Comparison with existing methods substantiates the effectiveness of
发表于 2025-3-29 18:04:50 | 显示全部楼层
Pivot Selection Strategies for Permutation-Based Similarity Search objects are represented as appropriately generated permutations of a set of pivots (or reference objects). Similarity queries are executed by searching for data objects whose permutation representation is similar to that of the query. This, of course assumes that similar objects are represented by
发表于 2025-3-29 21:43:44 | 显示全部楼层
Quantized Ranking for Permutation-Based Indexinglearning and data mining. The large volume of data that typical applications should handle imposes to find approximate solutions for the similarity search problem. Permutation-based indexing is one of the most recent techniques for approximate similarity search. Objects are represented by lists orde
发表于 2025-3-30 02:31:32 | 显示全部楼层
发表于 2025-3-30 06:46:15 | 显示全部楼层
Quicker Similarity Joins in Metric Spacesy, where . is a metric distance function and . ∈ ℝ. is user supplied query radius. In particular we are interested in the case where we have no index available (nor we can afford to build it) for either . or .. In this paper we improve the Quickjoin algorithm (Jacox and Samet, 2008), based on the we
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-6-7 15:44
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表