Seminar: Combining initial segments of lists

SpeakerWouter Koolen
AffiliationRoyal Holloway, University of London
DateThursday, 16 Feb 2012
Time13:00 - 14:00
LocationDarwin B.05
Event seriesCSML Joint Seminar Series

Wouldn't it be nice to throw together a bunch of web search engines, and obtain a super search engine by combining their results? We develop the theory of this and related questions. We build efficient algorithms for combining initial segments of lists, and prove two lower bounds.

iCalendar csml_id_7.ics