The Windowing Technique for Longest Segment Problems
June 20, 2009
Reviewing Zantema’s “windowing” technique for computing the longest segment of the input that satisfies a suffix-closed predicate. ... [no comments...].
Reviewing Zantema’s “windowing” technique for computing the longest segment of the input that satisfies a suffix-closed predicate. ... [no comments...].
Longest Segment Satisfying Suffix and Overlap-Closed Predicates
June 7, 2009
Translating Zantema’s work to Bird-Meertens style, to compute the longest consecutive segment of the input that satisfies a predicate that is suffix and overlap-closed. ... [no comments...].
Translating Zantema’s work to Bird-Meertens style, to compute the longest consecutive segment of the input that satisfies a predicate that is suffix and overlap-closed. ... [no comments...].
On a Basic Property for the Longest Prefix Problem
June 2, 2009
Giving a constructive proof for one of the essential properties in Hans Zantema’s Longest Segment Problems. ... [no comments...].
Giving a constructive proof for one of the essential properties in Hans Zantema’s Longest Segment Problems. ... [no comments...].
Beamer Article Mode Does Not Save Paper?
May 19, 2009
Among all the features of Beamer I like is the article mode with which I can produce handouts. “It’s easier to read, and it saves paper!” I thought. ... [no comments...].
Among all the features of Beamer I like is the article mode with which I can produce handouts. “It’s easier to read, and it saves paper!” I thought. ... [no comments...].
No Inverses for Injective but Non-Surjective Functions?
May 11, 2009
“I cannot prove that if a function is injective, it has an inverse,” Hideki Hashimoto posed this question to me. Is it possible at all? ... [12 comments...].
“I cannot prove that if a function is injective, it has an inverse,” Hideki Hashimoto posed this question to me. Is it possible at all? ... [12 comments...].
