Algorithm for finding best k-step function approximation given a set of 2D points, for a particular distance metric. Written as an assignment for Advanced Data Structures course at IIT Delhi.
-
Notifications
You must be signed in to change notification settings - Fork 0
sansiddhjain/k-function-approximation
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Algorithm for finding best k-step function approximation given a set of 2D points, for a particular distance metric.
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published