event thumbnail image
Workshop: The Future of Web Search

Efficient Lazy Algorithms for Minimal-Interval Semantics

author: Sebastiano Vigna, University of Milano
You might be experiencing some problems with Your Video player.
Slides
0:01 Prime Time for Minimal–Interval Semantics
0:35 A Crash Course in Minimal–Interval Semantics
2:04 Why Minimal–Interval Semantics?
3:06 Why Minimal–Interval Semantics?
4:36 How to compute it?
5:36 How to compute it?
6:03 How to compute it?
6:12 How to compute it?
6:29 How to compute it?
6:39 How to compute it?
7:01 How to compute it?
7:34 How to compute it?
8:06 You Can Do It Quickly!
9:20 Can We Get Out Of The Boolean Tunnel?
10:15 Wanna Try?

Lecture rating

People found this lecture:
Worth seeing
because it is:
 Valuable and informative
Well presented
Easily understandable
Acceptably recorded
You need to login to cast your vote.

Report a problem or upload files

If you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.
Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.

Link this page

Would you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !

Write your own review or comment: