Campus Event Calendar
Event Entry
What and Who
Probabilistic Scheduling for Top-k Index Processing
Anna Moleda
IMPRS-CS
Master-Seminar
AG 1, AG 2, AG 3, AG 4, AG 5
MPI Audience
Note: We use this to send email in the morning.
Date, Time and Location
Tuesday, 19 April 2005
13:05
-- Not specified --
46.1 - MPII
024
Saarbrücken
Abstract
Probabilistic Scheduling for Top-k Index Processing
Search engines are known to everyone. Google, Yahoo! Search, MSN
Search. Researchers work very hard to make them give better quality
results. My thesis is not to make them more accurate but to make
them faster. I will present the Top-k threshold algorithm that works
on inverted index lists and show how we try to speed it up.
Search engines are known to everyone. Google, Yahoo! Search, MSN
Search. Researchers work very hard to make them give better quality
results. My thesis is not to make them more accurate but to make
them faster. I will present the Top-k threshold algorithm that works
on inverted index lists and show how we try to speed it up.
Contact
--email hidden
passcode not visible
logged in users only
Friederike Gerndt, 04/14/2005 15:04
Kerstin Meyer-Ross, 04/12/2005 15:51 -- Created document.
Kerstin Meyer-Ross, 04/12/2005 15:51 -- Created document.