<?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/tag/sublinear"><title>BibSonomy publications for /tag/sublinear</title><link>BibSonomypublrss/tag/sublinear</link><description>BibSonomy RSS feed for /tag/sublinear</description><dc:date>2012-02-15T22:49:47+01:00</dc:date><items><rdf:Seq><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/22ac72f325854c528edd8b104d4fa8a14/ytyoun"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/24f0fc9b9af8ea0be84df495d5853eced/ytyoun"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2a38e4db933aa42897716bb9cfb91d664/ytyoun"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2512d004fda049d2d9f93fefaa579f4ce/ytyoun"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/266c5200c662ee76d4a538644f64fe05a/ytyoun"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/28e7d664e29056208e6818a22dcc0e7da/vittorio.loreto"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2aefebd47960cc8db2b02d9b3bbdeda11/vitelot"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/22880e455274e0550c32770efab99ba91/vitelot"/></rdf:Seq></items></channel><item rdf:about="http://www.bibsonomy.org/bibtex/22ac72f325854c528edd8b104d4fa8a14/ytyoun"><title>Sublinear-Time Algorithms for Tournament Graphs</title><link>http://www.bibsonomy.org/bibtex/22ac72f325854c528edd8b104d4fa8a14/ytyoun</link><dc:creator>ytyoun</dc:creator><dc:date>2012-01-19T20:42:26+01:00</dc:date><dc:subject>imported sublinear tournament </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Dantchev&#034;&gt;Stefan S. Dantchev&lt;/a&gt;, &lt;a href=&#034;/author/Friedetzky&#034;&gt;Tom Friedetzky&lt;/a&gt;,  and &lt;a href=&#034;/author/Nagel&#034;&gt;Lars Nagel&lt;/a&gt; &lt;/span&gt;&lt;em&gt;COCOON, &lt;/em&gt;&lt;em&gt;volume 5609 of Lecture Notes in Computer Science, &lt;/em&gt;&lt;em&gt;page 459-471. &lt;/em&gt;&lt;em&gt;Springer, &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/imported"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/sublinear"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/tournament"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/24f0fc9b9af8ea0be84df495d5853eced/ytyoun"><title>Sublinear-time algorithms for tournament graphs</title><link>http://www.bibsonomy.org/bibtex/24f0fc9b9af8ea0be84df495d5853eced/ytyoun</link><dc:creator>ytyoun</dc:creator><dc:date>2012-01-19T20:42:26+01:00</dc:date><dc:subject>imported sublinear tournament </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Dantchev&#034;&gt;Stefan S. Dantchev&lt;/a&gt;, &lt;a href=&#034;/author/Friedetzky&#034;&gt;Tom Friedetzky&lt;/a&gt;,  and &lt;a href=&#034;/author/Nagel&#034;&gt;Lars Nagel&lt;/a&gt; &lt;/span&gt;&lt;em&gt;J. Comb. Optim.&lt;/em&gt; &lt;em&gt;22(3):469-481&lt;/em&gt; (&lt;em&gt;2011&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/imported"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/sublinear"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/tournament"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/2a38e4db933aa42897716bb9cfb91d664/ytyoun"><title>Sublinear algorithms for testing monotone and unimodal distributions</title><link>http://www.bibsonomy.org/bibtex/2a38e4db933aa42897716bb9cfb91d664/ytyoun</link><dc:creator>ytyoun</dc:creator><dc:date>2012-01-12T23:26:48+01:00</dc:date><dc:subject>imported monotonicity property-testing sublinear unimodal </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Batu&#034;&gt;Tugkan Batu&lt;/a&gt;, &lt;a href=&#034;/author/Kumar&#034;&gt;Ravi Kumar&lt;/a&gt;,  and &lt;a href=&#034;/author/Rubinfeld&#034;&gt;Ronitt Rubinfeld&lt;/a&gt; &lt;/span&gt;&lt;em&gt;STOC, &lt;/em&gt;&lt;em&gt;page 381-390. &lt;/em&gt;&lt;em&gt;ACM, &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/imported"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/monotonicity"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/property-testing"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/sublinear"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/unimodal"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/2512d004fda049d2d9f93fefaa579f4ce/ytyoun"><title>Sublinear-time Algorithms</title><link>http://www.bibsonomy.org/bibtex/2512d004fda049d2d9f93fefaa579f4ce/ytyoun</link><dc:creator>ytyoun</dc:creator><dc:date>2011-12-20T05:33:31+01:00</dc:date><dc:subject>imported sublinear </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Czumaj&#034;&gt;Artur Czumaj&lt;/a&gt;,  and &lt;a href=&#034;/author/Sohler&#034;&gt;Christian Sohler&lt;/a&gt; &lt;/span&gt;&lt;em&gt;Property Testing, &lt;/em&gt;&lt;em&gt;volume 6390 of Lecture Notes in Computer Science, &lt;/em&gt;&lt;em&gt;page 41-64. &lt;/em&gt;&lt;em&gt;Springer, &lt;/em&gt;(&lt;em&gt;2010&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/imported"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/sublinear"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/266c5200c662ee76d4a538644f64fe05a/ytyoun"><title>Optimal constant-time approximation algorithms and unconditional
               inapproximability results for every bounded-degree CSP</title><link>http://www.bibsonomy.org/bibtex/266c5200c662ee76d4a538644f64fe05a/ytyoun</link><dc:creator>ytyoun</dc:creator><dc:date>2011-11-27T21:46:24+01:00</dc:date><dc:subject>imported sublinear </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Yoshida&#034;&gt;Yuichi Yoshida&lt;/a&gt; &lt;/span&gt;&lt;em&gt;STOC, &lt;/em&gt;&lt;em&gt;page 665-674. &lt;/em&gt;&lt;em&gt;ACM, &lt;/em&gt;(&lt;em&gt;2011&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/imported"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/sublinear"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/28e7d664e29056208e6818a22dcc0e7da/vittorio.loreto"><title>The collective dynamics of social annotation</title><link>http://www.bibsonomy.org/bibtex/28e7d664e29056208e6818a22dcc0e7da/vittorio.loreto</link><dc:creator>vittorio.loreto</dc:creator><dc:date>2008-06-19T13:28:26+02:00</dc:date><dc:subject>2008 annotation baldassarri barrat cattuto cooccurrence growth loreto network schehr social sublinear tagorapub </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Cattuto&#034;&gt;C. Cattuto&lt;/a&gt;, &lt;a href=&#034;/author/Barrat&#034;&gt;A. Barrat&lt;/a&gt;, &lt;a href=&#034;/author/Baldassarri&#034;&gt;A. Baldassarri&lt;/a&gt;, &lt;a href=&#034;/author/Schehr&#034;&gt;G. Schehr&lt;/a&gt;,  and &lt;a href=&#034;/author/Loreto&#034;&gt;V. Loreto&lt;/a&gt; &lt;/span&gt;(&lt;em&gt;2008&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/2008"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/annotation"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/baldassarri"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/barrat"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/cattuto"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/cooccurrence"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/growth"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/loreto"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/network"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/schehr"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/social"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/sublinear"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/tagorapub"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/2aefebd47960cc8db2b02d9b3bbdeda11/vitelot"><title>Overview of the Third Text REtrieval Conference</title><link>http://www.bibsonomy.org/bibtex/2aefebd47960cc8db2b02d9b3bbdeda11/vitelot</link><dc:creator>vitelot</dc:creator><dc:date>2007-02-13T23:08:50+01:00</dc:date><dc:subject>english retrieval text exponents sublinear corpus powerlaw heaps </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Harman&#034;&gt;D. Harman&lt;/a&gt; &lt;/span&gt;&lt;em&gt;NIST Special Publication 500-207, &lt;/em&gt;(&lt;em&gt;1995&lt;/em&gt;)&lt;em&gt;NIST Special Publication 500-207
		    .
	    &lt;/em&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/english"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/retrieval"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/text"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/exponents"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/sublinear"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/corpus"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/powerlaw"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/heaps"/></rdf:Bag></taxo:topics><description>ResearchIndex [NEC Research Institute; CiteSeer]</description></item><item rdf:about="http://www.bibsonomy.org/bibtex/22880e455274e0550c32770efab99ba91/vitelot"><title>Dynamics of Text Generation with Realistic Zipf&#039;s Distribution</title><link>http://www.bibsonomy.org/bibtex/22880e455274e0550c32770efab99ba91/vitelot</link><dc:creator>vitelot</dc:creator><dc:date>2007-02-09T13:41:32+01:00</dc:date><dc:subject>vocabulary dictionary growth zipf sublinear simon </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Zanette&#034;&gt;Damián H Zanette&lt;/a&gt;,  and &lt;a href=&#034;/author/Montemurro&#034;&gt;Marcelo A Montemurro&lt;/a&gt; &lt;/span&gt;&lt;em&gt;Journal of Quantitative Linguistics&lt;/em&gt; &lt;em&gt;12(1):29-40&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/vocabulary"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/dictionary"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/growth"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/zipf"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/sublinear"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/simon"/></rdf:Bag></taxo:topics></item></rdf:RDF>
