<?xml version="1.0" encoding="UTF-8"?>
<rdf:RDF xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:taxo="http://purl.org/rss/1.0/modules/taxonomy/" xmlns="http://purl.org/rss/1.0/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"><channel rdf:about="https://www.bibsonomy.org/user/fsteeg/trees"><title>BibSonomy bookmarks for /user/fsteeg/trees</title><link>https://www.bibsonomy.org/user/fsteeg/trees</link><description>BibSonomy RSS Feed for /user/fsteeg/trees</description><items><rdf:Seq><rdf:li rdf:resource="http://bayes.cs.ucla.edu/jp_home.html"/><rdf:li rdf:resource="http://www.topcoder.com/tc?module=Static&amp;d1=tutorials&amp;d2=lowestCommonAncestor"/><rdf:li rdf:resource="http://cs.nyu.edu/cs/faculty/shasha/papers/tree.html"/><rdf:li rdf:resource="http://www.essex.ac.uk/linguistics/clmt/latex4ling/trees/"/><rdf:li rdf:resource="http://www.cs.rhul.ac.uk/home/chris/TLA/tla.html"/><rdf:li rdf:resource="http://www.ling.uni-potsdam.de/~rvogel/xyling/"/><rdf:li rdf:resource="http://www.matijs.net/software/synttree/"/><rdf:li rdf:resource="http://www.mcdowella.demon.co.uk/programs.html"/></rdf:Seq></items></channel><item rdf:about="http://bayes.cs.ucla.edu/jp_home.html"><title>Homepage of Judea Pearl</title><description>Judea Pearl is one of the pioneers of Bayesian networks and the probabilistic approach to artificial intelligence. Invented the belief propagation algorithm.</description><link>http://bayes.cs.ucla.edu/jp_home.html</link><dc:creator>fsteeg</dc:creator><dc:date>2007-05-31T16:15:49+02:00</dc:date><dc:subject>bayes htm trees </dc:subject><content:encoded>&lt;span itemprop=&#034;description&#034;&gt;Judea Pearl is one of the pioneers of Bayesian networks and the probabilistic approach to artificial intelligence. Invented the belief propagation algorithm.&lt;/span&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/bayes"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/htm"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/trees"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.topcoder.com/tc?module=Static&amp;d1=tutorials&amp;d2=lowestCommonAncestor"><title>Algorithm Tutorials</title><description>Range Minimum Query and Lowest Common Ancestor</description><link>http://www.topcoder.com/tc?module=Static&amp;d1=tutorials&amp;d2=lowestCommonAncestor</link><dc:creator>fsteeg</dc:creator><dc:date>2006-12-28T04:47:12+01:00</dc:date><dc:subject>algorithms lca suffix-trees trees </dc:subject><content:encoded>&lt;span itemprop=&#034;description&#034;&gt;Range Minimum Query and Lowest Common Ancestor&lt;/span&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/algorithms"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/lca"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/suffix-trees"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/trees"/></rdf:Bag></taxo:topics></item><item rdf:about="http://cs.nyu.edu/cs/faculty/shasha/papers/tree.html"><title>Approximate Tree Matcher</title><description></description><link>http://cs.nyu.edu/cs/faculty/shasha/papers/tree.html</link><dc:creator>fsteeg</dc:creator><dc:date>2006-12-18T22:58:10+01:00</dc:date><dc:subject>algorithms approximate matching trees </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2006-12-18T22:58:10+01:00&#034; href=&#034;http://cs.nyu.edu/cs/faculty/shasha/papers/tree.html&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://cs.nyu.edu/cs/faculty/shasha/papers/tree.html&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/algorithms"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/approximate"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/matching"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/trees"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.essex.ac.uk/linguistics/clmt/latex4ling/trees/"><title>Tree Drawing in LaTeX</title><description>Overview</description><link>http://www.essex.ac.uk/linguistics/clmt/latex4ling/trees/</link><dc:creator>fsteeg</dc:creator><dc:date>2006-01-21T16:04:43+01:00</dc:date><dc:subject>latex trees </dc:subject><content:encoded>&lt;span itemprop=&#034;description&#034;&gt;Overview&lt;/span&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/latex"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/trees"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.cs.rhul.ac.uk/home/chris/TLA/tla.html"><title>TLA</title><description>Prolog/XPCE based GUI for creating trees for various latex packages</description><link>http://www.cs.rhul.ac.uk/home/chris/TLA/tla.html</link><dc:creator>fsteeg</dc:creator><dc:date>2006-01-21T16:00:56+01:00</dc:date><dc:subject>latex prolog trees </dc:subject><content:encoded>&lt;span itemprop=&#034;description&#034;&gt;Prolog/XPCE based GUI for creating trees for various latex packages&lt;/span&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/latex"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/prolog"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/trees"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.ling.uni-potsdam.de/~rvogel/xyling/"><title>xyling - LaTeX macros for linguistic graphics</title><description>allows labels of edges and more</description><link>http://www.ling.uni-potsdam.de/~rvogel/xyling/</link><dc:creator>fsteeg</dc:creator><dc:date>2006-01-21T15:33:32+01:00</dc:date><dc:subject>latex trees </dc:subject><content:encoded>&lt;span itemprop=&#034;description&#034;&gt;allows labels of edges and more&lt;/span&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/latex"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/trees"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.matijs.net/software/synttree/"><title>synttree: A LaTeX package for typesetting syntactic trees</title><description>simple</description><link>http://www.matijs.net/software/synttree/</link><dc:creator>fsteeg</dc:creator><dc:date>2006-01-21T15:26:07+01:00</dc:date><dc:subject>latex trees </dc:subject><content:encoded>&lt;span itemprop=&#034;description&#034;&gt;simple&lt;/span&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/latex"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/trees"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.mcdowella.demon.co.uk/programs.html"><title>Short Descriptions of Java classes</title><description>Java classes for string algorithms, includes a java-implementation of constant-time lca retrieval</description><link>http://www.mcdowella.demon.co.uk/programs.html</link><dc:creator>fsteeg</dc:creator><dc:date>2006-01-21T14:38:29+01:00</dc:date><dc:subject>algorithms java strings suffix-trees trees </dc:subject><content:encoded>&lt;span itemprop=&#034;description&#034;&gt;Java classes for string algorithms, includes a java-implementation of constant-time lca retrieval&lt;/span&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/algorithms"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/java"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/strings"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/suffix-trees"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/trees"/></rdf:Bag></taxo:topics></item></rdf:RDF>