Older blog entries for sness (starting at number 5807)

search - Ukkonen's suffix tree algorithm in plain English? - Stack Overflow

search - Ukkonen's suffix tree algorithm in plain English? - Stack Overflow: "The algorithm works in steps, from left to right. There is one step for every character of the string. Each step might involve more than one individual operation, but we will see (see the final observations at the end) that the total number of operations is O(n)."

'via Blog this'

Syndicated 2013-09-20 16:52:00 from sness




using ascii art in sublimetext. would be easy in emacs.

Syndicated 2013-09-20 16:51:00 from sness

▶ Burning Man 2013 Time-Lapse: Seen Miles Away From A Mountain Top - YouTube

▶ Burning Man 2013 Time-Lapse: Seen Miles Away From A Mountain Top - YouTube: "