cbloom rants
9/30/2011
09-30-11 - String Match Results Part 4
›
Okay, finally on to greedy parsing. Note with greedy parsing the average match length per byte is always Two charts for each , the first ...
09-30-11 - String Match Results Part 2b
›
Still on optimal parsing, exact matching, large window : Chart of clocks per byte, on each file of a test set : On my "lztest...
09-30-11 - String Match Results Part 3
›
Still doing "optimal" (non-greedy parsing) but now lets move on to windowed & non-exact matching. Windowed, possibly approx...
09-30-11 - String Match Results Part 5 + Conclusion
›
Finally for completeness, some of the matchers from Tornado in FreeArc. These are basically all standard "cache table" style matc...
09-30-11 - String Match Results Part 1
›
I was hoping to make some charts and graphs, but it's just not that interesting. Anyhoo, let's get into it. What am I testing? ...
09-30-11 - Don't use memset to zero
›
A very common missed optimization is letting the OS zero large chunks of memory for you. Everybody just writes code like this : U32 * ...
7 comments:
09-30-11 - String Match Results Part 2
›
The first and simplest set of results are the ones where non-O(N) algorithms make themselves known. Optimal parsing, large window. The...
9/29/2011
09-29-11 - Suffix Tries 3 - On Follows with Path Compression
›
Some subtle things that it took me a few days to track down. Writing for my reference. 1. Follows updates should be a bit "lazy...
9/28/2011
09-28-11 - String Matching with Suffix Arrays
›
A suffix sorter (such as the excellent divsufsort by Yuta Mori) provides a list of the suffix positions in an array in sorted order. Eg. so...
1 comment:
09-28-11 - Algorithm - Next Index with Lower Value
›
You are given an array of integers A[] For each i, find the next entry j (j > i) such that the value is lower (A[j] Fill out B[i] = ...
5 comments:
‹
›
Home
View web version