algorithms [2c626284]
Tags: Computers
1. Sorting Algorithms [8aea1888]
1. Sorting Algorithms [8aea1888]
- pdqsort - github.com/orlp/pdqsort
2. K-means [dcf476dc]
2. K-means [dcf476dc]
- Used to find k non-overlapping subclusters in a big cluster
-
Format
- User specifies the k number of subclusters
- Algorithm chooses k centroids in the feature space for finding k different clusters
- Assigns points relatively nearer to each centroid point
- Repeatedly recomputes the centroids until it has no more changes in position
3. Marzullo's Algorithm
3. Marzullo's Algorithm
- Fault tolerant algorithm designed for use in distributed systems
-
Algo
- Collects interval estimates from all sources
-
Sort and process intervals based on their start times, and then processes each interval in the sorted order
- Each interval the algo tracks the number of overlapping intervals
-
Determines the maximum overlap
- Finds the interval where the maximum overlap occurs, and the overlapping region is considered to be the most reliable estimate
- Fault tolerance: inherently tolerates faults
-
Uses
- Clock syncronization
-
Sensor fusion
- When multiple sensors measure the same physical quantity
-
Fault-tolerant systems
- Provides resilable estimates from potentially faulty inputs
4. Base64 vs Base62
4. Base64 vs Base62
- Base62 strips the
+and/characters, which may trip up browsers