- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
Online-Ressource, 1 online resource.
- Language
-
Englisch
- Bibliographic citation
-
Fast but approximate homomorphic k-means based on masking technique ; day:17 ; month:6 ; year:2023 ; pages:1-15
International journal of information security ; (17.6.2023), 1-15
- Creator
-
Rovida, Lorenzo
- Contributor
-
SpringerLink (Online service)
- DOI
-
10.1007/s10207-023-00708-9
- URN
-
urn:nbn:de:101:1-2023092208090354851694
- Rights
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
14.08.2025, 10:57 AM CEST
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Rovida, Lorenzo
- SpringerLink (Online service)
Other Objects (12)
Theorie - k-means Clustering
Improved Time Series k-means
k-means clustering for persistent homology
The LINEX Weighted k-Means Clustering
The global Minmax k-means algorithm
K-means for shared frailty models
Adapting k-means for graph clustering
Even Faster Exact k-Means Clustering
Private k-Means with Constant Multiplicative Error
Programmierung - k-means Clustering mit Scikit-learn
Large scale K-means clustering using GPUs
ParaKMeans: Implementation of a parallelized K-means algorithm suitable for general laboratory use
Theorie - k-means Clustering
Improved Time Series k-means
k-means clustering for persistent homology
The LINEX Weighted k-Means Clustering
The global Minmax k-means algorithm
K-means for shared frailty models
Adapting k-means for graph clustering
Even Faster Exact k-Means Clustering
Private k-Means with Constant Multiplicative Error
Programmierung - k-means Clustering mit Scikit-learn
Large scale K-means clustering using GPUs
ParaKMeans: Implementation of a parallelized K-means algorithm suitable for general laboratory use
Theorie - k-means Clustering
Improved Time Series k-means
k-means clustering for persistent homology
The LINEX Weighted k-Means Clustering
The global Minmax k-means algorithm
K-means for shared frailty models
Adapting k-means for graph clustering
Even Faster Exact k-Means Clustering
Private k-Means with Constant Multiplicative Error
Programmierung - k-means Clustering mit Scikit-learn
Large scale K-means clustering using GPUs