| 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 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 |
| The Effect of Random Projection on Local Intrinsic Dimensionality
|
2021 |
Houle, Michael E. |
| Handling Class Imbalance in k-Nearest Neighbor Classification by Balancing Prior Probabilities
|
2021 |
Gøttcke, Jonatan Møller Nuutinen |
| Towards an Italian Healthcare Knowledge Graph
|
2021 |
Postiglione, Marco |
| Scaling Up Set Similarity Joins Using a Cost-Based Distributed-Paralle Framework
|
2021 |
Fier, Fabian |
| On Generalizing Permutation-Based Representations for Approximate Search
|
2021 |
Vadicamo, Lucia |
| Similarity vs. Relevance: From Simple Searches to Complex Discovery
|
2021 |
Skopal, Tomáš |
| Optimizing Fair Approximate Nearest Neighbor Searches Using Threaded B+ Trees
|
2021 |
Jafari, Omid |
| Non-parametric Semi-supervised Learning by Bayesian Label Distribution Propagation
|
2021 |
Gottcke, Jonatan Mgaller Nuutinen |
Tag hinzufügen