Filtrer vos résultats
- 8
- 3
- 2
- 2
- 1
- 1
- 8
- 1
- 1
- 2
- 1
- 1
- 2
- 8
- 6
- 6
- 4
- 4
- 1
- 1
- 1
- 8
- 6
- 3
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
8 résultats
|
|
triés par
|
|
Nobody cares if you liked Star Wars: KNN graph construction on the cheapEuropar 2018, Aug 2018, Turin, Italy. pp.419-431, ⟨10.1007/978-3-319-96983-1_30⟩
Communication dans un congrès
hal-01867230v1
|
||
|
Fingerprinting Big Data: The Case of KNN Graph Construction[Research Report] RR-9218, INRIA Rennes - Bretagne Atlantique; INRIA - IRISA - PANAMA; Université de Rennes 1; EPFL; Mediego. 2018, pp.1-30
Rapport
hal-01904341v1
|
||
|
Complexity of Update Consistent Universal Constructions2022
Pré-publication, Document de travail
hal-03813789v1
|
||
|
Cluster-and-Conquer: When Randomness Meets Graph Locality2020
Pré-publication, Document de travail
hal-02974077v1
|
||
|
Cluster-and-Conquer: When Randomness Meets Graph LocalityICDE 2021 - IEEE 37th International Conference on Data Engineering, Apr 2021, Chania, Greece. pp.2027-2032, ⟨10.1109/ICDE51399.2021.00195⟩
Communication dans un congrès
hal-03346860v1
|
||
|
Elastic Bloom Filter: Deletable and ExpandableFilter Using Elastic FingerprintsIEEE Transactions on Computers, 2021, pp.1-1. ⟨10.1109/TC.2021.3067713⟩
Article dans une revue
hal-03347690v1
|
||
|
Fingerprinting Big Data: The Case of KNN Graph ConstructionICDE 2019 - 35th IEEE International Conference on Data Engineering, Apr 2019, Macao, China. pp.1738-1741, ⟨10.1109/ICDE.2019.00186⟩
Communication dans un congrès
hal-02357950v1
|
||
|
GoldFinger: Fast & Approximate Jaccard for Efficient KNN Graph ConstructionsIEEE Transactions on Knowledge and Data Engineering, 2023, 35 (11), pp.11461-11475. ⟨10.1109/TKDE.2022.3232689⟩
Article dans une revue
hal-04394851v1
|