Knuth-Morris-Pratt algorithm: " suffix of the portion u of the text. Moreover, if we want to avoid another immediate mismatch, the character following the prefix v in the pattern must be different from a. The longest such prefix v is called the tagged border of u (it occurs at both ends of u followed by different characters in x).
This introduces the notation: let kmpNext[i] be the length of the longest border of x[0 .. i-1] followed by a character c different from x[i] and -1 if no such tagged border exits, for 0 < i m. Then, after a shift, the comparisons can resume between characters x[kmpNext[i]] and y[i j] without missing any occurrence of x in y, and avoiding a backtrack on the text (see figure 7.1). The value of kmpNext[0] is set to -1."
- posted by gleemie @ 1:49 AM

 
Web Style Guide, 2nd Edition

Great resource!
- posted by gleemie @ 1:26 PM

 
Free newsletter - HFI's UI Design Update: "What can we conclude when users are reading prose text from monitors? Users tend to read faster if the line lengths are longer (up to 10 inches). If the line lengths are too short (2.5 inches or less) it may impede rapid reading. Finally, users tend to prefer lines that are moderately long (4 to 5 inches)."
- posted by gleemie @ 11:38 AM

 
In case you didn't know, I've been blogging my little blog-o-thoughtspew here at:
http://www.livejournal.com/users/gleemie

Blogger is a fabulous service, but livejournal allows comments so for now, I have my community home there.

- posted by gleemie @ 3:48 PM