| Organizing Similarity Spaces Using Metric Hulls
|
2021 |
Jánošová, Miriama |
| How Many Neighbours for Known-Item Search?
|
2021 |
Lokoč, Jakub |
| Structural Intrinsic Dimensionality
|
2021 |
Marchand-Maillet, Stephane |
| Metric Indexing for Graph Similarity Search
|
2021 |
Bause, Franka |
| The Minimum Edit Arborescence Problem and Its Use in Compressing Graph Collections
|
2021 |
Gnecco, Lucas |
| FIMSIM: Discovering Communities by Frequent Item-Set Mining and Similarity Search
|
2021 |
Peschel, Jakub |
| Discovering Latent Information from Noisy Sources in the Cultural Heritage Domain
|
2021 |
Scarrone, Fabrizio |
| A Triangle Inequality for Cosine Similarity
|
2021 |
Schubert, Erich |
| Data-Driven Learned Metric Index: An Unsupervised Approach
|
2021 |
Slanináková, Terézia |
| Accelerating Spherical k-Means
|
2021 |
Schubert, Erich |
| MESS: Manifold Embedding Motivated Super Sampling
|
2021 |
Thordsen, Erik |
| What Makes a Good Movie Recommendation? Feature Selection for Content-Based Filtering
|
2021 |
Gawinecki, Maciej |
| Indexed Polygon Matching Under Similarities
|
2021 |
Luque-Suarez, Fernando |
| Graph Embedding in Vector Spaces Using Matching-traphs
|
2021 |
Fuchs, Mathias |
| An A*-algorithm for the Unordered Tree Edit Distance wıth Custom Costs
|
2021 |
Paaßen, Benjamin |
| A Cost Model for Reverse Nearest Neighbor Query Processing on R-Trees Using Self Pruning
|
2021 |
Borutta, Felix |
| Towards a Learned Index Structure for Approximate Nearest Neighbor Search Query Processing
|
2021 |
Hünemörder, Maximilian |
| Fairest Neighbors: Tradeoffs Between Metric Queries
|
2021 |
Hetland, Magnus Lie |
| Local Intrinsic Dimensionality and Graphs: Towards LID-aware Graph Embedding Algorithms
|
2021 |
Savic, Miloš |
| Relationships Between Local Intrinsic Dimensionality and Tail Entropy
|
2021 |
Bailey, James |
Tag hinzufügen