<?xml version="1.0" encoding="UTF-8"?>
<rdf:RDF xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:taxo="http://purl.org/rss/1.0/modules/taxonomy/" xmlns:burst="http://xmlns.com/burst/0.1/" xmlns:xsd="http://www.w3.org/2001/XMLSchema#" xmlns="http://purl.org/rss/1.0/" xmlns:admin="http://webns.net/mvcb/" xmlns:rdfs="http://www.w3.org/2000/01/rdf-schema#" xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:owl="http://www.w3.org/2002/07/owl#" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:syn="http://purl.org/rss/1.0/modules/syndication/" xmlns:swrc="http://swrc.ontoware.org/ontology#" xmlns:cc="http://web.resource.org/cc/"><channel rdf:about="http://www.bibsonomy.org/user/diego_ma/graphs"><title>BibSonomy publications for /user/diego_ma/graphs</title><link>BibSonomypublrss/user/diego_ma/graphs</link><description>BibSonomy RSS feed for /user/diego_ma/graphs</description><dc:date>2012-02-16T13:53:21+01:00</dc:date><items><rdf:Seq><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2de1dc83f8e8cd4ef34ab24d1892ce125/diego_ma"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/287535fc865377ad1ff4d3274c10de5eb/diego_ma"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2d40066e489bb1545f2afc538c451b0b3/diego_ma"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/289ee81638dd47b1b73db44a450fcc9c6/diego_ma"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2fba6245ea01851e754dc8bf624ab4a7b/diego_ma"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/28da10dbb292cd3eecb3451ffb87a63c3/diego_ma"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/265077387e10c6c8083a91f1ca1b6035d/diego_ma"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2cede8e16fef190210dab74b1eb62e3f0/diego_ma"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/26f849c3568dc266a7c289fdcf8bd2530/diego_ma"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/26457a5616a3fee4e058285cc1b1fdc1c/diego_ma"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2dabdecfb125d424336d794650ac3fb18/diego_ma"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2a0dc35525ce0731f7a30168629510750/diego_ma"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2b9b5edb603375e5afc421e54f08c1831/diego_ma"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2cc5b934f613f05a1bed04d07e8a97bea/diego_ma"/></rdf:Seq></items></channel><item rdf:about="http://www.bibsonomy.org/bibtex/2de1dc83f8e8cd4ef34ab24d1892ce125/diego_ma"><title>Using query expansion in graph-based approach for query-focused multi-document summarization.</title><link>http://www.bibsonomy.org/bibtex/2de1dc83f8e8cd4ef34ab24d1892ce125/diego_ma</link><dc:creator>diego_ma</dc:creator><dc:date>2009-02-12T00:28:46+01:00</dc:date><dc:subject>summarisation question_answering graphs </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Zhao&#034;&gt;Lin Zhao&lt;/a&gt;, &lt;a href=&#034;/author/Wu&#034;&gt;Lide Wu&lt;/a&gt;,  and &lt;a href=&#034;/author/Huang&#034;&gt;Xuanjing Huang&lt;/a&gt; &lt;/span&gt;&lt;em&gt;Information Processing and Management&lt;/em&gt; &lt;em&gt;45(1):35-41&lt;/em&gt; (&lt;em&gt;2009&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/summarisation"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/question_answering"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/graphs"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/287535fc865377ad1ff4d3274c10de5eb/diego_ma"><title>Multi-document Summarization by Graph Search and Matching</title><link>http://www.bibsonomy.org/bibtex/287535fc865377ad1ff4d3274c10de5eb/diego_ma</link><dc:creator>diego_ma</dc:creator><dc:date>2008-02-26T06:39:48+01:00</dc:date><dc:subject>graphs summarisation </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Mani&#034;&gt;Inderjeet Mani&lt;/a&gt;,  and &lt;a href=&#034;/author/Bloedorn&#034;&gt;Eric Bloedorn&lt;/a&gt; &lt;/span&gt;&lt;em&gt;CoRR&lt;/em&gt;  (&lt;em&gt;1997&lt;/em&gt;)&lt;em&gt;informal publication
		    .
	    &lt;/em&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/graphs"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/summarisation"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/2d40066e489bb1545f2afc538c451b0b3/diego_ma"><title>Learning of Graph-based Question Answering Rules</title><link>http://www.bibsonomy.org/bibtex/2d40066e489bb1545f2afc538c451b0b3/diego_ma</link><dc:creator>diego_ma</dc:creator><dc:date>2008-02-06T06:48:51+01:00</dc:date><dc:subject>graphs AnswerFinder molla_publication </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Mollá&#034;&gt;Diego Mollá&lt;/a&gt; &lt;/span&gt;&lt;em&gt;Proc. HLT/NAACL 2006 Workshop on Graph Algorithms for Natural Language Processing, &lt;/em&gt;&lt;em&gt;page 37-44. &lt;/em&gt;(&lt;em&gt;2006&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/graphs"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/AnswerFinder"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/molla_publication"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/289ee81638dd47b1b73db44a450fcc9c6/diego_ma"><title>AnswerFinder at TREC 2005</title><link>http://www.bibsonomy.org/bibtex/289ee81638dd47b1b73db44a450fcc9c6/diego_ma</link><dc:creator>diego_ma</dc:creator><dc:date>2008-01-29T07:21:22+01:00</dc:date><dc:subject>AnswerFinder graphs molla_publication </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Mollá&#034;&gt;Diego Mollá&lt;/a&gt;,  and &lt;a href=&#034;/author/van Zaanen&#034;&gt;Menno van Zaanen&lt;/a&gt; &lt;/span&gt;(&lt;em&gt;2006&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/AnswerFinder"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/graphs"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/molla_publication"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/2fba6245ea01851e754dc8bf624ab4a7b/diego_ma"><title>Conceptual Dependency: A Theory of Natural Language Understanding</title><link>http://www.bibsonomy.org/bibtex/2fba6245ea01851e754dc8bf624ab4a7b/diego_ma</link><dc:creator>diego_ma</dc:creator><dc:date>2007-12-14T02:46:15+01:00</dc:date><dc:subject>graphs NLP </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Schank&#034;&gt;Roger C. Schank&lt;/a&gt; &lt;/span&gt;&lt;em&gt;Cognitive Psychology&lt;/em&gt; &lt;em&gt;3(4):532-631&lt;/em&gt; (&lt;em&gt;1972&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/graphs"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/NLP"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/28da10dbb292cd3eecb3451ffb87a63c3/diego_ma"><title>Semantic Memory</title><link>http://www.bibsonomy.org/bibtex/28da10dbb292cd3eecb3451ffb87a63c3/diego_ma</link><dc:creator>diego_ma</dc:creator><dc:date>2007-12-14T02:45:26+01:00</dc:date><dc:subject>graphs semantics </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Quillian&#034;&gt;Ross Quillian&lt;/a&gt; &lt;/span&gt;&lt;em&gt;Semantic Information Processing, &lt;/em&gt;&lt;em&gt;MIT Press, &lt;/em&gt;(&lt;em&gt;1968&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/graphs"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/semantics"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/265077387e10c6c8083a91f1ca1b6035d/diego_ma"><title>Textual Entailment as Syntactic Graph Distance: a rule based and a SVM based approach</title><link>http://www.bibsonomy.org/bibtex/265077387e10c6c8083a91f1ca1b6035d/diego_ma</link><dc:creator>diego_ma</dc:creator><dc:date>2007-12-14T02:44:52+01:00</dc:date><dc:subject>graphs entailment </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Pazienza&#034;&gt;Maria Teresa Pazienza&lt;/a&gt;, &lt;a href=&#034;/author/Pennacchiotti&#034;&gt;Marco Pennacchiotti&lt;/a&gt;,  and &lt;a href=&#034;/author/Zanzotto&#034;&gt;Fabio Massimo Zanzotto&lt;/a&gt; &lt;/span&gt;&lt;em&gt;Proceedings PASCAL RTE challenge 2005, &lt;/em&gt;(&lt;em&gt;2005&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/graphs"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/entailment"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/2cede8e16fef190210dab74b1eb62e3f0/diego_ma"><title>Conceptual Graph Matching: a flexible algorithm and experiments</title><link>http://www.bibsonomy.org/bibtex/2cede8e16fef190210dab74b1eb62e3f0/diego_ma</link><dc:creator>diego_ma</dc:creator><dc:date>2007-12-14T02:44:23+01:00</dc:date><dc:subject>graphs </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Myaeng&#034;&gt;Sung H. Myaeng&lt;/a&gt;,  and &lt;a href=&#034;/author/López-López&#034;&gt;Aurelio López-López&lt;/a&gt; &lt;/span&gt;&lt;em&gt;Journal of Experimentation and Theoretical Artificial Intelligence&lt;/em&gt;  (&lt;em&gt;1992&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/graphs"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/26f849c3568dc266a7c289fdcf8bd2530/diego_ma"><title>Semantic-Structure-Based Search Engine</title><link>http://www.bibsonomy.org/bibtex/26f849c3568dc266a7c289fdcf8bd2530/diego_ma</link><dc:creator>diego_ma</dc:creator><dc:date>2007-12-14T02:43:29+01:00</dc:date><dc:subject>inf_retrieval graphs logical_forms </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Miyata&#034;&gt;Takashi Miyata&lt;/a&gt;,  and &lt;a href=&#034;/author/Hasida&#034;&gt;Kôiti Hasida&lt;/a&gt; &lt;/span&gt;&lt;em&gt;Proc. WWW05 workshop on Activities on Semantic Web Technologies in Japan, &lt;/em&gt;(&lt;em&gt;2005&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/inf_retrieval"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/graphs"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/logical_forms"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/26457a5616a3fee4e058285cc1b1fdc1c/diego_ma"><title>Graph-based Ranking Algorithms for Sentence Extraction Applied to Text Summarization</title><link>http://www.bibsonomy.org/bibtex/26457a5616a3fee4e058285cc1b1fdc1c/diego_ma</link><dc:creator>diego_ma</dc:creator><dc:date>2007-12-14T02:43:21+01:00</dc:date><dc:subject>graphs summarisation </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Mihalcea&#034;&gt;Rada Mihalcea&lt;/a&gt; &lt;/span&gt;&lt;em&gt;Proceedings of the 42nd Annual Meeting of the Association for Computational Linguistics, companion volume ACL 2004, &lt;/em&gt;(&lt;em&gt;2004&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/graphs"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/summarisation"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/2dabdecfb125d424336d794650ac3fb18/diego_ma"><title>From Exact to Approximate Maximum Common Subgraph</title><link>http://www.bibsonomy.org/bibtex/2dabdecfb125d424336d794650ac3fb18/diego_ma</link><dc:creator>diego_ma</dc:creator><dc:date>2007-12-14T02:42:56+01:00</dc:date><dc:subject>graphs </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Marini&#034;&gt;Simone Marini&lt;/a&gt;, &lt;a href=&#034;/author/Spagnuolo&#034;&gt;Michela Spagnuolo&lt;/a&gt;,  and &lt;a href=&#034;/author/Falcidieno&#034;&gt;Bianca Falcidieno&lt;/a&gt; &lt;/span&gt;&lt;em&gt;Proc. Graph-Based Representations in Pattern Recognition GbRPR, &lt;/em&gt;&lt;em&gt; 3434, &lt;/em&gt;&lt;em&gt;page 263-272. &lt;/em&gt;(&lt;em&gt;2005&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/graphs"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/2a0dc35525ce0731f7a30168629510750/diego_ma"><title>Common Subgraph Isomorphism Detection by Backtracking Search</title><link>http://www.bibsonomy.org/bibtex/2a0dc35525ce0731f7a30168629510750/diego_ma</link><dc:creator>diego_ma</dc:creator><dc:date>2007-12-14T02:41:47+01:00</dc:date><dc:subject>graphs common_subgraphs backtracking_algorithm </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Krissinel&#034;&gt;Evgeny B. Krissinel&lt;/a&gt;,  and &lt;a href=&#034;/author/Henrick&#034;&gt;Kim Henrick&lt;/a&gt; &lt;/span&gt;&lt;em&gt;Software Practice and Experience&lt;/em&gt;  (&lt;em&gt;2004&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/graphs"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/common_subgraphs"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/backtracking_algorithm"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/2b9b5edb603375e5afc421e54f08c1831/diego_ma"><title>Graph Branch Algorithm: An Optimum Tree Search Method for Scored Dependency Graph with Arc Co-occurrence Constraints</title><link>http://www.bibsonomy.org/bibtex/2b9b5edb603375e5afc421e54f08c1831/diego_ma</link><dc:creator>diego_ma</dc:creator><dc:date>2007-12-14T02:40:22+01:00</dc:date><dc:subject>graphs ambiguity DG </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Hirakawa&#034;&gt;Hideki Hirakawa&lt;/a&gt; &lt;/span&gt;&lt;em&gt;Journal of Natural Language Processing&lt;/em&gt; &lt;em&gt;13(4):3-31&lt;/em&gt; (&lt;em&gt;2006&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/graphs"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/ambiguity"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/DG"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/2cc5b934f613f05a1bed04d07e8a97bea/diego_ma"><title>A Comparison of Algorithms for Maximum Common Subgraph on Randomly Connected Graphs</title><link>http://www.bibsonomy.org/bibtex/2cc5b934f613f05a1bed04d07e8a97bea/diego_ma</link><dc:creator>diego_ma</dc:creator><dc:date>2007-12-14T02:36:52+01:00</dc:date><dc:subject>graphs </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Bunke&#034;&gt;H. Bunke&lt;/a&gt;, &lt;a href=&#034;/author/Foggia&#034;&gt;P. Foggia&lt;/a&gt;, &lt;a href=&#034;/author/Guidobaldi&#034;&gt;C. Guidobaldi&lt;/a&gt;, &lt;a href=&#034;/author/Sansone&#034;&gt;C. Sansone&lt;/a&gt;,  and &lt;a href=&#034;/author/Vento&#034;&gt;M. Vento&lt;/a&gt; &lt;/span&gt;&lt;em&gt;Lecture Notes on Computer Science, &lt;/em&gt;&lt;em&gt; 2396, &lt;/em&gt;&lt;em&gt;Springer-Verlag, &lt;/em&gt;&lt;em&gt;Heidelberg, &lt;/em&gt;(&lt;em&gt;2002&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/graphs"/></rdf:Bag></taxo:topics></item></rdf:RDF>
