Similarity Search and Applications: 13th International Conference, SISAP 2020, Copenhagen, Denmark, September 30 – October 2, 2020, Proceedings: Lecture Notes in Computer Science, cartea 12440
Editat de Shin'ichi Satoh, Lucia Vadicamo, Arthur Zimek, Fabio Carrara, Ilaria Bartolini, Martin Aumüller, Björn Þór Jónsson, Rasmus Paghen Limba Engleză Paperback – 15 oct 2020
Din seria Lecture Notes in Computer Science
- 20% Preț: 1040.03 lei
- 20% Preț: 333.46 lei
- 20% Preț: 335.08 lei
- 20% Preț: 444.17 lei
- 20% Preț: 238.01 lei
- 20% Preț: 333.46 lei
- 20% Preț: 438.69 lei
- Preț: 440.52 lei
- 20% Preț: 336.71 lei
- 20% Preț: 148.66 lei
- 20% Preț: 310.26 lei
- 20% Preț: 256.27 lei
- 20% Preț: 632.22 lei
- 17% Preț: 427.22 lei
- 20% Preț: 641.78 lei
- 20% Preț: 307.71 lei
- 20% Preț: 1053.45 lei
- 20% Preț: 579.56 lei
- Preț: 373.56 lei
- 20% Preț: 330.23 lei
- 15% Preț: 429.74 lei
- 20% Preț: 607.39 lei
- 20% Preț: 538.29 lei
- Preț: 389.48 lei
- 20% Preț: 326.98 lei
- 20% Preț: 1386.07 lei
- 20% Preț: 1003.66 lei
- 20% Preț: 567.60 lei
- 20% Preț: 575.48 lei
- 20% Preț: 571.63 lei
- 20% Preț: 747.79 lei
- 15% Preț: 568.74 lei
- 17% Preț: 360.19 lei
- 20% Preț: 504.57 lei
- 20% Preț: 172.69 lei
- 20% Preț: 369.12 lei
- 20% Preț: 346.40 lei
- 20% Preț: 574.05 lei
- Preț: 402.62 lei
- 20% Preț: 584.40 lei
- 20% Preț: 747.79 lei
- 20% Preț: 809.19 lei
- 20% Preț: 649.49 lei
- 20% Preț: 343.16 lei
- 20% Preț: 309.90 lei
- 20% Preț: 122.89 lei
Preț: 583.44 lei
Preț vechi: 729.30 lei
-20% Nou
Puncte Express: 875
Preț estimativ în valută:
111.69€ • 116.10$ • 92.61£
111.69€ • 116.10$ • 92.61£
Carte tipărită la comandă
Livrare economică 05-19 februarie 25
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783030609351
ISBN-10: 3030609359
Pagini: 350
Ilustrații: XIX, 414 p. 210 illus., 104 illus. in color.
Dimensiuni: 155 x 235 mm
Greutate: 0.61 kg
Ediția:1st ed. 2020
Editura: Springer International Publishing
Colecția Springer
Seriile Lecture Notes in Computer Science, Information Systems and Applications, incl. Internet/Web, and HCI
Locul publicării:Cham, Switzerland
ISBN-10: 3030609359
Pagini: 350
Ilustrații: XIX, 414 p. 210 illus., 104 illus. in color.
Dimensiuni: 155 x 235 mm
Greutate: 0.61 kg
Ediția:1st ed. 2020
Editura: Springer International Publishing
Colecția Springer
Seriile Lecture Notes in Computer Science, Information Systems and Applications, incl. Internet/Web, and HCI
Locul publicării:Cham, Switzerland
Cuprins
Scalable Similarity Search.- Accelerating Metric Filtering by Improving Bounds on Estimated Distances.- Differentially Private Sketches for Jaccard Similarity Estimation.- Pivot Selection for Narrow Sketches by Optimization Algorithms.- mmLSH: A Practical and Efficient Technique for Processing Approximate Nearest Neighbor Queries on Multimedia Data.- Parallelizing Filter-Verification based Exact Set Similarity Joins on Multicores.- Similarity Search with Tensor Core Units.- On the Problem of p1 in Locality-Sensitive Hashing.- Similarity Measures, Search, and Indexing.- Confirmation Sampling for Exact Nearest Neighbor Search.- Optimal Metric Search Is Equivalent to the Minimum Dominating Set Problem.- Metrics and Ambits and Sprawls, Oh My: Another Tutorial on Metric Indexing.- Some branches may bear rotten fruits: Diversity browsing VP-Trees.- Continuous Similarity Search for Evolving Database.- Taking advantage of highly-correlated attributes in similarity queries with missing values.- Similarity Between Points in Metric Measure Spaces.- High-dimensional Data and Intrinsic Dimensionality.- GTT: Guiding the Tensor Train Decomposition.- Noise Adaptive Tensor Train Decomposition for Low-Rank Embedding of Noisy Data.- ABID: Angle Based Intrinsic Dimensionality.- Sampled Angles in High-Dimensional Spaces.- Local Intrinsic Dimensionality III: Density and Similarity.- Analysing Indexability of Intrinsically High-dimensional Data using TriGen.- Reverse k-Nearest Neighbors Centrality Measures and Local Intrinsic Dimension.- Clustering.- BETULA: Numerically Stable CF-Trees for BIRCH Clustering.- Using a Set of Triangle Inequalities to Accelerate K-means Clustering.- Angle-Based Clustering.- Artificial Intelligence and Similarity.- Improving Locality Sensitive Hashing by Efficiently Finding Projected Nearest Neighbors.- SIR: Similar Image Retrieval for Product Search in E-Commerce.- Cross-Resolution deep features based Image Search.- LearningDistance Estimators from Pivoted Embeddings of Metric Objects.- Demo and Position Papers.- Visualizer of Dataset Similarity using Knowledge Graph.- vitrivr-explore: Guided Multimedia Collection Exploration for Ad-hoc Video Search.- Running experiments with confidence and sanity.- Doctoral Symposium.- Temporal Similarity of Trajectories in Graphs.- Relational Visual-Textual Information Retrieval.