|
|
 |
|
|
| Addicted to LOST? Commercial |
 |
Finally, there's a solution for all of us who
can't pull ourselves away from Lost.
Visit:
http://www.rhettandlink.com/perspective
Also, join our Community Building Exercise by
making a video response! Visit
http://www.rhettandlink.com/sevenkeys for
details on why you'd want to participate.
1. Produce a television commercial spoof.
Promote anything you want...OR choose one of
the following "products" to promote:
- PERSPECTIVE
- PUNCTUALITY
- CREEPINESS
- SHOE HORN GREASE (inspired by Jordan &
Sara's idea.)
- NEAT HANDWRITING
2. TIME LIMIT: 90 seconds or less
3. Keep it "family friendly"
4. Upload it to YouTube, then make it a
response to our video.
5. Email us at: rhettandlinksubmit@gmail.com
- subject line (in all CAPS): MARCH CBE ENTRY
- include in body of email: YOUR NAME,
YOUTUBE ID, CHAT ID, MAILING ADDRESS, THE URL
TO YOUR VIDEO
6. DUE DATE: Wednesday, April 2, 2008
Tags : rhettandlink lost commercial jj abrams season abc prescription drug spoof parody matthew fox premiere |
|
Affichage : 87117
Durée : 86 s |
| Similarity Search: A Web Perspective |
 |
Google Tech Talks
October, 18 2007
ABSTRACT
Similarity search is the problem of
preprocessing a database of N objects in such
a way that given a query object, one can
effectively determine its nearest neighbors
in database. "Geometric near-neighbor
access tree" data structure, an early
work (1995) by Sergey Brin, is one of the
most known solutions to this problem.
Similarity search is closely connected to
many algorithmic problems in the web.
Similarity search is an abstraction of many
algorithmic problems we face in data
management. In this talk we will focus on:
- Personalized news aggregation: Searching
for news articles that are most similar to
the user's profile of interests
- Behavioral targeting: Searching for the
most relevant advertisement for displaying to
a given user.
- Social network analysis: Suggesting new
friends.
- Computing co-occurrence similarities.
- "Best match search": Searching
resumes, jobs, BF/GF, cars, apartments.
We describe features that make web
applications somewhat different from
previously studied models. Thus we re-examine
the formalization and the classical
algorithms for similarity search. This leads
us to new algorithms (we present two of them)
and numerous open problems in the field.
Speaker: Yury Lifshits
Yury Lifshits obtained his PhD degree from
Steklov Institute of Mathematics at S...
Tags : google techtalks techtalk engedu talk talks googletechtalks education |
|
Affichage : 9142
Durée : 2422 s |
|
|
|
|
|
|
|
|
|
|
 |
| |
|
