michaelingit/K-meansCluster
A java implementation of k-means algorithm.It uses ball tree as internal data structure to accelerate the computation.It uses 2-norm distance to compute the similarity between instances.
Public repository discovered through GitHub real-time crawl.
This repository is cataloged as part of our automated global GitHub synchronization. Full telemetry, velocity snapshots, and code summaries are scheduled for continuous enrichment.
A java implementation of k-means algorithm.It uses ball tree as internal data structure to accelerate the computation.It uses 2-norm distance to compute the similarity between instances.
Code Related to the Tabris Demos
An image loading and caching library for Android focused on smooth scrolling
Android Unpacker presented at Defcon 22: Android Hacker Protection Level 0