On 03.11.2005 at 12:20 in S7, there is the following noon lecture:
Internet meets Combinatorics
A gentle introduction to combinatorial and algorithmic problems related to searching in huge collections of textual documents, especially in the World-Wide Web. These problems include external-memory graph algorithms, classification of document similarity (from edit distance to Broder's signature scheme) and randomized data structures.
This talk is inspired by the on-going collaboration between ITI and Centrum.CZ.
Webmaster: kamweb.mff.cuni.cz Modified: 25. 02. 2019