標(biāo)題: Titlebook: Similarity Search and Applications; 7th International Co Agma Juci Machado Traina,Caetano Traina,Robson Leo Conference proceedings 2014 Spr [打印本頁] 作者: Prehypertension 時間: 2025-3-21 19:02
書目名稱Similarity Search and Applications影響因子(影響力)
書目名稱Similarity Search and Applications影響因子(影響力)學(xué)科排名
書目名稱Similarity Search and Applications網(wǎng)絡(luò)公開度
書目名稱Similarity Search and Applications網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Similarity Search and Applications被引頻次
書目名稱Similarity Search and Applications被引頻次學(xué)科排名
書目名稱Similarity Search and Applications年度引用
書目名稱Similarity Search and Applications年度引用學(xué)科排名
書目名稱Similarity Search and Applications讀者反饋
書目名稱Similarity Search and Applications讀者反饋學(xué)科排名
作者: SNEER 時間: 2025-3-22 00:07
Faster Proximity Searching with the Distal SATlinear sized indexes in the model of distance computations..In summary, we obtained an index more resistant to the curse of dimensionality, establishing a new benchmark in performance, faster to build than the . and with a small memory footprint. Our strategies can be used in any version of the ., either in main or secondary memory.作者: 執(zhí) 時間: 2025-3-22 02:29 作者: REIGN 時間: 2025-3-22 08:29
0302-9743 rs are organized in topical sections on Improving Similarity Search Methods and Techniques; Indexing and Applications; Metrics and Evaluation; New Scenarios and Approaches; Applications and Specific Domains.978-3-319-11987-8978-3-319-11988-5Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: Gustatory 時間: 2025-3-22 10:18 作者: Nebulous 時間: 2025-3-22 13:39
Efficient Algorithms for Similarity Search in Axis-Aligned Subspacesions are specified at query time. In this paper, we propose several new methods for the subspace similarity search problem. Extensive experiments are provided showing very competitive performance relative to state-of-the-art solutions.作者: CBC471 時間: 2025-3-22 19:42 作者: Iatrogenic 時間: 2025-3-23 00:23
A Dynamic Pivoting Algorithm Based on Spatial Approximation Indexesesult is a technique that allows one to traverse a dynamic . without necessarily comparing all traversed nodes against the query object. As a result, the novel algorithm makes a much better use of the available space, yielding a saving of distance computations of about 10% to 70%, compared with previous . schemes that use pivot information.作者: HARD 時間: 2025-3-23 01:55 作者: Mendacious 時間: 2025-3-23 07:34
The Similarity-Aware Relational Intersect Database Operatorn-source database system, namely PostgreSQL. Several queries from the TPC-H benchmark are extended to include similarity-based set intersetion predicates. Performance results demonstrate up to three orders of magnitude speedup in performance over equivalent queries that only employ regular operators.作者: CHAR 時間: 2025-3-23 10:44 作者: 發(fā)牢騷 時間: 2025-3-23 15:07 作者: Aggregate 時間: 2025-3-23 21:21
Efficient Algorithms for Similarity Search in Axis-Aligned Subspaces search. Given a query object, the goal of subspace similarity search is to retrieve the most similar objects from the database, where the similarity distance is defined over an arbitrary subset of dimensions (or features) — that is, an arbitrary axis-aligned projective subspace. Though much effort 作者: Osmosis 時間: 2025-3-23 23:05
Partial Refinement for Similarity Search with Multiple Featuresse has one major drawback: when an object is refined, the partial distances to the query object are computed for .. This frequently leads to more distance computations being executed than necessary to exclude an object. To address this problem, we introduce ., a simple, yet efficient improvement of 作者: CUR 時間: 2025-3-24 06:24 作者: cipher 時間: 2025-3-24 10:35
Some Theoretical and Experimental Observations on Permutation Spaces and Similarity Search data objects whose permutation representation is similar to the query one. Various permutation-based indexes have been recently proposed. They typically allow high efficiency with acceptable effectiveness. Moreover, various parameters can be set in order to find an optimal trade-off between quality作者: 橡子 時間: 2025-3-24 12:42
Metric Space Searching Based on Random Bisectors and Binary Fingerprintsos where the main memory available is small. The method was tested on synthetic and real-world metric spaces. Our results show that our scheme outperforms the standard permutant-based index in scenarios where memory is scarce.作者: 多骨 時間: 2025-3-24 18:51
Faster Proximity Searching with the Distal SATes instead of the proximal nodes proposed in the original paper. Our approach is parameter free and it was the most competitive in an extensive benchmarking, from two to forty times faster than the ., and faster than the List of Clusters (.) which is considered the state of the art for main memory, 作者: 羽飾 時間: 2025-3-24 21:17
A Dynamic Pivoting Algorithm Based on Spatial Approximation Indexes, in particular, are efficient data structures, which have shown to be competitive in metric spaces of medium to high difficulty, or queries with low selectivity. . can be also made dynamic, and can use the available space to improve the query performance adding pivot information. In this paper we e作者: 寵愛 時間: 2025-3-25 02:24
Large-Scale Distributed Locality-Sensitive Hashing for General Metric Datad for just a handful of dissimilarities for which locality-sensitive families are available. In this work we propose Parallel Voronoi LSH, an approach that addresses those two limitations of LSH: it makes LSH efficient for distributed-memory architectures, and it works for very general dissimilariti作者: synovitis 時間: 2025-3-25 03:41 作者: Bumble 時間: 2025-3-25 09:33 作者: musicologist 時間: 2025-3-25 12:07 作者: 背信 時間: 2025-3-25 16:38
Transition-Sensitive Distancesced by the distance measure used for data comparison. Conventional distance measures, including Hamming distance (HD) and Levenshtein distance (LD), count merely the number of mismatches (or modifications). Given a query, samples mapped at the same distance have the same number of mismatches, but th作者: 托運(yùn) 時間: 2025-3-25 21:35
Retrieval of Binary Features in Image Databases: A Studyd interest points by a high-dimensional feature vector. To recognize objects, these systems have to match features detected in a query image against the features stored in a database containing millions or even billions of feature vectors. Hence, efficient matching is crucial for real applications. 作者: 的’ 時間: 2025-3-26 02:09
The Similarity-Aware Relational Intersect Database Operatoration. To make the underlying database system similarity-aware, the core relational operators have to be extended. Several similarity-aware relational operators have been proposed that introduce similarity processing at the database engine level, e.g., similarity joins and similarity group-by. This 作者: 同步信息 時間: 2025-3-26 05:58 作者: 抑制 時間: 2025-3-26 09:39 作者: 怒目而視 時間: 2025-3-26 16:25 作者: archaeology 時間: 2025-3-26 18:54 作者: EWE 時間: 2025-3-26 23:39 作者: 某人 時間: 2025-3-27 02:34
Giuseppe Amato,Fabrizio Falchi,Fausto Rabitti,Lucia Vadicamo作者: 靦腆 時間: 2025-3-27 08:43
José María Andrade,César A. Astudillo,Rodrigo Paredes作者: 金絲雀 時間: 2025-3-27 09:48
Edgar Chávez,Verónica Ludue?a,Nora Reyes,Patricia Roggero作者: malapropism 時間: 2025-3-27 15:24 作者: Oration 時間: 2025-3-27 18:03 作者: 慌張 時間: 2025-3-28 00:25 作者: Buttress 時間: 2025-3-28 02:08
Agma Juci Machado Traina,Caetano Traina,Robson Leo作者: 謙卑 時間: 2025-3-28 08:41 作者: Judicious 時間: 2025-3-28 13:45
Index-Based R-S Similarity Joinsmaximize performance. Our results show that our algorithm significantly outperforms the alternative one in terms of distance computations, and reveal interesting properties when comparing execution time.作者: 水槽 時間: 2025-3-28 15:26
A Compressed Index for Hamming Distancesnt (AFP), of independent interest..The combination of compressed LSH and the AFP enables the retrieval of lossy compressed audio with near perfect recall at bit-rates as low as 32 kbps, packing the representation of 30+ million music tracks of standard length (which is about the total number of uniq作者: peritonitis 時間: 2025-3-28 20:23 作者: 搜尋 時間: 2025-3-29 02:00 作者: Diatribe 時間: 2025-3-29 06:49 作者: 得罪人 時間: 2025-3-29 09:17
High Dimensional Search Using Polyhedral Queryh dimensions; however, we show that shrinking the polyhedron can capture a surprisingly high proportion of the points within the ball, whilst at the same time giving a more efficient, and more scalable, search..We show results which confirm our underlying hypothesis. In some cases we can retrieve si作者: CODA 時間: 2025-3-29 14:26
Anomaly Detection in Streaming Time Series Based on Bounding Boxesrectly for online detection, without any a priori knowledge and using the non-normalized Euclidean distance. Moreover, we show that our algorithm computes less CPU runtime in finding the anomaly than HOT SAX in normalized scenarios.作者: Lymphocyte 時間: 2025-3-29 16:06 作者: Credence 時間: 2025-3-29 20:23 作者: 伸展 時間: 2025-3-30 01:32 作者: NOT 時間: 2025-3-30 07:58
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/s/image/867408.jpg作者: 特征 時間: 2025-3-30 11:16
https://doi.org/10.1007/978-3-319-11988-5high performance computing; image retrieval; indexing; query processing; recommender systems; data struct作者: accrete 時間: 2025-3-30 14:40 作者: Ardent 時間: 2025-3-30 19:39
Conference proceedings 2014, Spain, in October 2014. The 21 full papers and 6 short papers presented were carefully reviewed and selected from 45 submissions. The papers are organized in topical sections on Improving Similarity Search Methods and Techniques; Indexing and Applications; Metrics and Evaluation; New Scenarios and Approaches; Applications and Specific Domains.作者: 出生 時間: 2025-3-30 21:16 作者: 檢查 時間: 2025-3-31 04:29 作者: Engaging 時間: 2025-3-31 09:02 作者: Detoxification 時間: 2025-3-31 12:03
Ronald L. Jacobsm. The mean difference between daily measured and modelled E was 0.02 mm with a standard deviation of 0.57 mm. Observed soil moisture (% by volume) ranged from 8.7% (near field capacity) to 4.7%, while modelled soil moisture ranged from 8.6% to 4.3%.作者: Ganglion-Cyst 時間: 2025-3-31 16:59 作者: Anticoagulants 時間: 2025-3-31 17:35 作者: 偽書 時間: 2025-3-31 21:50
