Talk by Simon Law.
This commit is contained in:
parent
cdf124da97
commit
13fb9fbdd7
25
events.xml
25
events.xml
|
@ -1,6 +1,31 @@
|
||||||
<eventdefs>
|
<eventdefs>
|
||||||
<!-- Winter 2004 -->
|
<!-- Winter 2004 -->
|
||||||
|
|
||||||
|
<eventitem date="2004-03-02" time="6:00 PM"
|
||||||
|
room="MC4042" title="Graphing webs-of-trust">
|
||||||
|
<short> A talk by Simon Law </short>
|
||||||
|
<abstract>
|
||||||
|
<p>
|
||||||
|
In today's world, people have hundreds of connexions. And you can
|
||||||
|
express these connexions with a graph. For instance, you may wish to
|
||||||
|
represent the network of your friends.
|
||||||
|
</p>
|
||||||
|
|
||||||
|
<p>
|
||||||
|
Originally, webs-of-trust were directed acyclic graphs of people who had
|
||||||
|
identified each other. This way, if there was a path between you and
|
||||||
|
the person who want to identify, then you could assume that each person
|
||||||
|
along that path had verified the next person's identity.
|
||||||
|
</p>
|
||||||
|
|
||||||
|
<p>
|
||||||
|
I will show you how to generate your own web-of-trust graph using Free
|
||||||
|
Software. Of course, you can also use this knowledge to graph anything
|
||||||
|
you like.
|
||||||
|
</p>
|
||||||
|
</abstract>
|
||||||
|
</eventitem>
|
||||||
|
|
||||||
<eventitem date="2004-02-18" time="7:00 PM"
|
<eventitem date="2004-02-18" time="7:00 PM"
|
||||||
room="DC2305" title="KW Perl Mongers">
|
room="DC2305" title="KW Perl Mongers">
|
||||||
<short>Perl Modules: A look under the hood</short>
|
<short>Perl Modules: A look under the hood</short>
|
||||||
|
|
Loading…
Reference in New Issue