'Logn time' presentation slideshows

Suffix arrays

Suffix arrays. Suffix array. We loose some of the functionality but we save space. Let s = abab. Sort the suffixes lexicographically: ab, abab, b, bab. The suffix array gives the indices of the suffixes in sorted order. 2. 0. 3. 1. How do we build it ?. Build a suffix tree

1.06k views • 72 slides

Suffix arrays

Suffix arrays. Suffix array. We loose some of the functionality but we save space. Let s = abab. Sort the suffixes lexicographically: ab, abab, b, bab. The suffix array gives the indices of the suffixes in sorted order. 2. 0. 3. 1. How do we build it ?. Build a suffix tree

664 views • 50 slides

Approximating Points by A Piecewise Linear Function: I

Approximating Points by A Piecewise Linear Function: I. Danny Z. Chen and Haitao Wang Computer Science and Engineering University of Notre Dame Indiana, USA. Outline. Problem definitions Motivations and previous work Our results. Problem Definitions. Input: A point set P (2-D or 3-D)

336 views • 33 slides

The selfish-edges Shortest-Path problem

The selfish-edges Shortest-Path problem. The selfish-edges SP problem.

344 views • 25 slides

Approximate Distance Oracles for Geometric Spanner Networks

307 views • 19 slides

An almost linear time and linear space algorithm for the longest common subsequence problem

213 views • 9 slides