CINXE.COM

Computer Science Oct 2008

<!DOCTYPE html> <html lang="en"> <head> <title>Computer Science Oct 2008</title> <meta name="viewport" content="width=device-width, initial-scale=1"> <link rel="apple-touch-icon" sizes="180x180" href="/static/browse/0.3.4/images/icons/apple-touch-icon.png"> <link rel="icon" type="image/png" sizes="32x32" href="/static/browse/0.3.4/images/icons/favicon-32x32.png"> <link rel="icon" type="image/png" sizes="16x16" href="/static/browse/0.3.4/images/icons/favicon-16x16.png"> <link rel="manifest" href="/static/browse/0.3.4/images/icons/site.webmanifest"> <link rel="mask-icon" href="/static/browse/0.3.4/images/icons/safari-pinned-tab.svg" color="#5bbad5"> <meta name="msapplication-TileColor" content="#da532c"> <meta name="theme-color" content="#ffffff"> <link rel="stylesheet" type="text/css" media="screen" href="/static/browse/0.3.4/css/arXiv.css?v=20241206" /> <link rel="stylesheet" type="text/css" media="print" href="/static/browse/0.3.4/css/arXiv-print.css?v=20200611" /> <link rel="stylesheet" type="text/css" media="screen" href="/static/browse/0.3.4/css/browse_search.css" /> <script language="javascript" src="/static/browse/0.3.4/js/accordion.js" /></script> <script src="/static/browse/0.3.4/js/mathjaxToggle.min.js" type="text/javascript"></script> <script type="text/javascript" language="javascript">mathjaxToggle();</script> </head> <body class="with-cu-identity"> <div class="flex-wrap-footer"> <header> <a href="#content" class="is-sr-only">Skip to main content</a> <!-- start desktop header --> <div class="columns is-vcentered is-hidden-mobile" id="cu-identity"> <div class="column" id="cu-logo"> <a href="https://www.cornell.edu/"><img src="/static/browse/0.3.4/images/icons/cu/cornell-reduced-white-SMALL.svg" alt="Cornell University" /></a> </div><div class="column" id="support-ack"> <span id="support-ack-url">We gratefully acknowledge support from the Simons Foundation, <a href="https://info.arxiv.org/about/ourmembers.html">member institutions</a>, and all contributors.</span> <a href="https://info.arxiv.org/about/donate.html" class="btn-header-donate">Donate</a> </div> </div> <div id="header" class="is-hidden-mobile"> <a aria-hidden="true" tabindex="-1" href="/IgnoreMe"></a> <div class="header-breadcrumbs"> <a href="/"><img src="/static/browse/0.3.4/images/arxiv-logo-one-color-white.svg" alt="arxiv logo" style="height:40px;"/></a> <span>&gt;</span> <a href="/list/cs/recent">cs</a> </div> <div class="search-block level-right"> <form class="level-item mini-search" method="GET" action="https://arxiv.org/search"> <div class="field has-addons"> <div class="control"> <input class="input is-small" type="text" name="query" placeholder="Search..." aria-label="Search term or terms" /> <p class="help"><a href="https://info.arxiv.org/help">Help</a> | <a href="https://arxiv.org/search/advanced">Advanced Search</a></p> </div> <div class="control"> <div class="select is-small"> <select name="searchtype" aria-label="Field to search"> <option value="all" selected="selected">All fields</option> <option value="title">Title</option> <option value="author">Author</option> <option value="abstract">Abstract</option> <option value="comments">Comments</option> <option value="journal_ref">Journal reference</option> <option value="acm_class">ACM classification</option> <option value="msc_class">MSC classification</option> <option value="report_num">Report number</option> <option value="paper_id">arXiv identifier</option> <option value="doi">DOI</option> <option value="orcid">ORCID</option> <option value="author_id">arXiv author ID</option> <option value="help">Help pages</option> <option value="full_text">Full text</option> </select> </div> </div> <input type="hidden" name="source" value="header"> <button class="button is-small is-cul-darker">Search</button> </div> </form> </div> </div><!-- /end desktop header --> <div class="mobile-header"> <div class="columns is-mobile"> <div class="column logo-arxiv"><a href="https://arxiv.org/"><img src="/static/browse/0.3.4/images/arxiv-logomark-small-white.svg" alt="arXiv logo" style="height:60px;" /></a></div> <div class="column logo-cornell"><a href="https://www.cornell.edu/"> <picture> <source media="(min-width: 501px)" srcset="/static/browse/0.3.4/images/icons/cu/cornell-reduced-white-SMALL.svg 400w" sizes="400w" /> <source srcset="/static/browse/0.3.4/images/icons/cu/cornell_seal_simple_black.svg 2x" /> <img src="/static/browse/0.3.4/images/icons/cu/cornell-reduced-white-SMALL.svg" alt="Cornell University Logo" /> </picture> </a></div> <div class="column nav" id="toggle-container" role="menubar"> <button class="toggle-control"><svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 512 512" class="icon filter-white"><title>open search</title><path d="M505 442.7L405.3 343c-4.5-4.5-10.6-7-17-7H372c27.6-35.3 44-79.7 44-128C416 93.1 322.9 0 208 0S0 93.1 0 208s93.1 208 208 208c48.3 0 92.7-16.4 128-44v16.3c0 6.4 2.5 12.5 7 17l99.7 99.7c9.4 9.4 24.6 9.4 33.9 0l28.3-28.3c9.4-9.4 9.4-24.6.1-34zM208 336c-70.7 0-128-57.2-128-128 0-70.7 57.2-128 128-128 70.7 0 128 57.2 128 128 0 70.7-57.2 128-128 128z"/></svg></button> <div class="mobile-toggle-block toggle-target"> <form class="mobile-search-form" method="GET" action="https://arxiv.org/search"> <div class="field has-addons"> <input class="input" type="text" name="query" placeholder="Search..." aria-label="Search term or terms" /> <input type="hidden" name="source" value="header"> <input type="hidden" name="searchtype" value="all"> <button class="button">GO</button> </div> </form> </div> <button class="toggle-control"><svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 448 512" class="icon filter-white" role="menu"><title>open navigation menu</title><path d="M16 132h416c8.837 0 16-7.163 16-16V76c0-8.837-7.163-16-16-16H16C7.163 60 0 67.163 0 76v40c0 8.837 7.163 16 16 16zm0 160h416c8.837 0 16-7.163 16-16v-40c0-8.837-7.163-16-16-16H16c-8.837 0-16 7.163-16 16v40c0 8.837 7.163 16 16 16zm0 160h416c8.837 0 16-7.163 16-16v-40c0-8.837-7.163-16-16-16H16c-8.837 0-16 7.163-16 16v40c0 8.837 7.163 16 16 16z"/ ></svg></button> <div class="mobile-toggle-block toggle-target"> <nav class="mobile-menu" aria-labelledby="mobilemenulabel"> <h2 id="mobilemenulabel">quick links</h2> <ul> <li><a href="https://arxiv.org/login">Login</a></li> <li><a href="https://info.arxiv.org/help">Help Pages</a></li> <li><a href="https://info.arxiv.org/about">About</a></li> </ul> </nav> </div> </div> </div> </div><!-- /end mobile-header --> </header> <main> <div id="content"> <div id='content-inner'> <div id='dlpage'> <h1>Computer Science</h1> <h2>Authors and titles for October 2008 </h2> <div class='paging'>Total of 321 entries : <span>1-50</span> <a href=/list/cs/2008-10?skip=50&amp;show=50>51-100</a> <a href=/list/cs/2008-10?skip=100&amp;show=50>101-150</a> <a href=/list/cs/2008-10?skip=150&amp;show=50>151-200</a> <span>...</span> <a href=/list/cs/2008-10?skip=300&amp;show=50>301-321</a> </div> <div class='morefewer'>Showing up to 50 entries per page: <a href=/list/cs/2008-10?skip=0&amp;show=25 rel="nofollow"> fewer</a> | <a href=/list/cs/2008-10?skip=0&amp;show=100 rel="nofollow"> more</a> | <a href=/list/cs/2008-10?skip=0&amp;show=2000 rel="nofollow"> all</a> </div> <dl id='articles'> <dt> <a name='item1'>[1]</a> <a href ="/abs/0810.0033" title="Abstract" id="0810.0033"> arXiv:0810.0033 </a> [<a href="/pdf/0810.0033" title="Download PDF" id="pdf-0810.0033" aria-labelledby="pdf-0810.0033">pdf</a>, <a href="/format/0810.0033" title="Other formats" id="oth-0810.0033" aria-labelledby="oth-0810.0033">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Complexity Classes as Mathematical Axioms </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&amp;query=Freedman,+M">M. Freedman</a></div> <div class='list-comments mathjax'><span class='descriptor'>Comments:</span> Some minor changes and one more reference. To appear in Ann. Math </div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Computational Complexity (cs.CC)</span>; Geometric Topology (math.GT) </div> </div> </dd> <dt> <a name='item2'>[2]</a> <a href ="/abs/0810.0052" title="Abstract" id="0810.0052"> arXiv:0810.0052 </a> [<a href="/pdf/0810.0052" title="Download PDF" id="pdf-0810.0052" aria-labelledby="pdf-0810.0052">pdf</a>, <a href="/format/0810.0052" title="Other formats" id="oth-0810.0052" aria-labelledby="oth-0810.0052">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Planar Visibility Counting </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&amp;query=Fischer,+M">Matthias Fischer</a>, <a href="https://arxiv.org/search/cs?searchtype=author&amp;query=Hilbig,+M">Matthias Hilbig</a>, <a href="https://arxiv.org/search/cs?searchtype=author&amp;query=J%C3%A4hn,+C">Claudius J盲hn</a>, <a href="https://arxiv.org/search/cs?searchtype=author&amp;query=der+Heide,+F+M+a">Friedhelm Meyer auf der Heide</a>, <a href="https://arxiv.org/search/cs?searchtype=author&amp;query=Ziegler,+M">Martin Ziegler</a></div> <div class='list-comments mathjax'><span class='descriptor'>Comments:</span> added Section 4: Implementation and Empirical Evaluation </div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Computational Geometry (cs.CG)</span>; Data Structures and Algorithms (cs.DS) </div> </div> </dd> <dt> <a name='item3'>[3]</a> <a href ="/abs/0810.0068" title="Abstract" id="0810.0068"> arXiv:0810.0068 </a> [<a href="/pdf/0810.0068" title="Download PDF" id="pdf-0810.0068" aria-labelledby="pdf-0810.0068">pdf</a>, <a href="/format/0810.0068" title="Other formats" id="oth-0810.0068" aria-labelledby="oth-0810.0068">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> On the Index Coding Problem and its Relation to Network Coding and Matroid Theory </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&amp;query=Rouayheb,+S+Y+E">Salim Y. El Rouayheb</a>, <a href="https://arxiv.org/search/cs?searchtype=author&amp;query=Sprintson,+A">Alex Sprintson</a>, <a href="https://arxiv.org/search/cs?searchtype=author&amp;query=Georghiades,+C+N">Costas N. Georghiades</a></div> <div class='list-comments mathjax'><span class='descriptor'>Comments:</span> submitted to transactions on information theory </div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Information Theory (cs.IT)</span> </div> </div> </dd> <dt> <a name='item4'>[4]</a> <a href ="/abs/0810.0075" title="Abstract" id="0810.0075"> arXiv:0810.0075 </a> [<a href="/pdf/0810.0075" title="Download PDF" id="pdf-0810.0075" aria-labelledby="pdf-0810.0075">pdf</a>, <a href="/format/0810.0075" title="Other formats" id="oth-0810.0075" aria-labelledby="oth-0810.0075">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Acerca del Algoritmo de Dijkstra </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&amp;query=Salas,+A">Alvaro Salas</a> (Universidad de Caldas, Universidad Nacional de Colombia, sede Manizales)</div> <div class='list-comments mathjax'><span class='descriptor'>Comments:</span> In spanish, the paper contains illustrations </div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Data Structures and Algorithms (cs.DS)</span> </div> </div> </dd> <dt> <a name='item5'>[5]</a> <a href ="/abs/0810.0135" title="Abstract" id="0810.0135"> arXiv:0810.0135 </a> [<a href="/pdf/0810.0135" title="Download PDF" id="pdf-0810.0135" aria-labelledby="pdf-0810.0135">pdf</a>, <a href="/format/0810.0135" title="Other formats" id="oth-0810.0135" aria-labelledby="oth-0810.0135">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Occupancy distributions of homogeneous queueing systems under opportunistic scheduling </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&amp;query=Alanyali,+M">Murat Alanyali</a>, <a href="https://arxiv.org/search/cs?searchtype=author&amp;query=Dashouk,+M">Maxim Dashouk</a></div> <div class='list-comments mathjax'><span class='descriptor'>Comments:</span> Submitted for possible publication </div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Performance (cs.PF)</span>; Networking and Internet Architecture (cs.NI) </div> </div> </dd> <dt> <a name='item6'>[6]</a> <a href ="/abs/0810.0139" title="Abstract" id="0810.0139"> arXiv:0810.0139 </a> [<a href="/pdf/0810.0139" title="Download PDF" id="pdf-0810.0139" aria-labelledby="pdf-0810.0139">pdf</a>, <a href="/format/0810.0139" title="Other formats" id="oth-0810.0139" aria-labelledby="oth-0810.0139">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Determining the Unithood of Word Sequences using a Probabilistic Approach </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&amp;query=Wong,+W">Wilson Wong</a>, <a href="https://arxiv.org/search/cs?searchtype=author&amp;query=Liu,+W">Wei Liu</a>, <a href="https://arxiv.org/search/cs?searchtype=author&amp;query=Bennamoun,+M">Mohammed Bennamoun</a></div> <div class='list-comments mathjax'><span class='descriptor'>Comments:</span> More information is available at <a href="http://explorer.csse.uwa.edu.au/reference/" rel="external noopener nofollow" class="link-external link-http">this http URL</a> </div> <div class='list-journal-ref'><span class='descriptor'>Journal-ref:</span> 3rd International Joint Conference on Natural Language Processing (IJCNLP), 2008, pages 103-110 </div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Artificial Intelligence (cs.AI)</span> </div> </div> </dd> <dt> <a name='item7'>[7]</a> <a href ="/abs/0810.0154" title="Abstract" id="0810.0154"> arXiv:0810.0154 </a> [<a href="/pdf/0810.0154" title="Download PDF" id="pdf-0810.0154" aria-labelledby="pdf-0810.0154">pdf</a>, <a href="/format/0810.0154" title="Other formats" id="oth-0810.0154" aria-labelledby="oth-0810.0154">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Optimization of sequences in CDMA systems: a statistical-mechanics approach </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&amp;query=Kitagawa,+K">Koichiro Kitagawa</a>, <a href="https://arxiv.org/search/cs?searchtype=author&amp;query=Tanaka,+T">Toshiyuki Tanaka</a></div> <div class='list-comments mathjax'><span class='descriptor'>Comments:</span> 17pages, submitted to Special Issue on Interdisciplinary Paradigms for Networking in International Journal of Computer and Telecommunications Networking </div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Information Theory (cs.IT)</span> </div> </div> </dd> <dt> <a name='item8'>[8]</a> <a href ="/abs/0810.0156" title="Abstract" id="0810.0156"> arXiv:0810.0156 </a> [<a href="/pdf/0810.0156" title="Download PDF" id="pdf-0810.0156" aria-labelledby="pdf-0810.0156">pdf</a>, <a href="/format/0810.0156" title="Other formats" id="oth-0810.0156" aria-labelledby="oth-0810.0156">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Determining the Unithood of Word Sequences using Mutual Information and Independence Measure </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&amp;query=Wong,+W">Wilson Wong</a>, <a href="https://arxiv.org/search/cs?searchtype=author&amp;query=Liu,+W">Wei Liu</a>, <a href="https://arxiv.org/search/cs?searchtype=author&amp;query=Bennamoun,+M">Mohammed Bennamoun</a></div> <div class='list-comments mathjax'><span class='descriptor'>Comments:</span> More information is available at <a href="http://explorer.csse.uwa.edu.au/reference/" rel="external noopener nofollow" class="link-external link-http">this http URL</a> </div> <div class='list-journal-ref'><span class='descriptor'>Journal-ref:</span> 10th Conference of the Pacific Association for Computational Linguistics (PACLING), 2007, pages 246-254 </div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Artificial Intelligence (cs.AI)</span> </div> </div> </dd> <dt> <a name='item9'>[9]</a> <a href ="/abs/0810.0200" title="Abstract" id="0810.0200"> arXiv:0810.0200 </a> [<a href="/pdf/0810.0200" title="Download PDF" id="pdf-0810.0200" aria-labelledby="pdf-0810.0200">pdf</a>, <a href="/format/0810.0200" title="Other formats" id="oth-0810.0200" aria-labelledby="oth-0810.0200">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Distribution of complexities in the Vai script </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&amp;query=Rovenchak,+A">Andrij Rovenchak</a>, <a href="https://arxiv.org/search/cs?searchtype=author&amp;query=Ma%C4%8Dutek,+J">J谩n Ma膷utek</a>, <a href="https://arxiv.org/search/cs?searchtype=author&amp;query=Riley,+C">Charles Riley</a></div> <div class='list-comments mathjax'><span class='descriptor'>Comments:</span> 13 pages </div> <div class='list-journal-ref'><span class='descriptor'>Journal-ref:</span> Glottometrics 18, 1-12 (2009) </div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Computation and Language (cs.CL)</span> </div> </div> </dd> <dt> <a name='item10'>[10]</a> <a href ="/abs/0810.0264" title="Abstract" id="0810.0264"> arXiv:0810.0264 </a> [<a href="/pdf/0810.0264" title="Download PDF" id="pdf-0810.0264" aria-labelledby="pdf-0810.0264">pdf</a>, <a href="/format/0810.0264" title="Other formats" id="oth-0810.0264" aria-labelledby="oth-0810.0264">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> A Fast Generic Sequence Matching Algorithm </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&amp;query=Musser,+D+R">David R. Musser</a>, <a href="https://arxiv.org/search/cs?searchtype=author&amp;query=Nishanov,+G+V">Gor V. Nishanov</a></div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Data Structures and Algorithms (cs.DS)</span> </div> </div> </dd> <dt> <a name='item11'>[11]</a> <a href ="/abs/0810.0322" title="Abstract" id="0810.0322"> arXiv:0810.0322 </a> [<a href="/pdf/0810.0322" title="Download PDF" id="pdf-0810.0322" aria-labelledby="pdf-0810.0322">pdf</a>, <a href="/format/0810.0322" title="Other formats" id="oth-0810.0322" aria-labelledby="oth-0810.0322">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Non-negative mixed finite element formulations for a tensorial diffusion equation </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&amp;query=Nakshatrala,+K">K.B. Nakshatrala</a>, <a href="https://arxiv.org/search/cs?searchtype=author&amp;query=A.J.Valocchi">A.J.Valocchi</a></div> <div class='list-comments mathjax'><span class='descriptor'>Comments:</span> 40 pages using amsart style file, and 15 figures </div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Numerical Analysis (math.NA)</span> </div> </div> </dd> <dt> <a name='item12'>[12]</a> <a href ="/abs/0810.0326" title="Abstract" id="0810.0326"> arXiv:0810.0326 </a> [<a href="/pdf/0810.0326" title="Download PDF" id="pdf-0810.0326" aria-labelledby="pdf-0810.0326">pdf</a>, <a href="/format/0810.0326" title="Other formats" id="oth-0810.0326" aria-labelledby="oth-0810.0326">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Collision Resolution by Exploiting Symbol Misalignment </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&amp;query=Lu,+L">Lu Lu</a>, <a href="https://arxiv.org/search/cs?searchtype=author&amp;query=Liew,+S+C">Soung Chang Liew</a>, <a href="https://arxiv.org/search/cs?searchtype=author&amp;query=Zhang,+S">Shengli Zhang</a></div> <div class='list-comments mathjax'><span class='descriptor'>Comments:</span> conference </div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Networking and Internet Architecture (cs.NI)</span>; Information Theory (cs.IT) </div> </div> </dd> <dt> <a name='item13'>[13]</a> <a href ="/abs/0810.0328" title="Abstract" id="0810.0328"> arXiv:0810.0328 </a> [<a href="/pdf/0810.0328" title="Download PDF" id="pdf-0810.0328" aria-labelledby="pdf-0810.0328">pdf</a>, <a href="/format/0810.0328" title="Other formats" id="oth-0810.0328" aria-labelledby="oth-0810.0328">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Efficient Defence against Misbehaving TCP Receiver DoS Attacks </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&amp;query=Chan,+A+C">Aldar C-F. Chan</a></div> <div class='list-journal-ref'><span class='descriptor'>Journal-ref:</span> Computer Networks, 2011 </div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Cryptography and Security (cs.CR)</span>; Networking and Internet Architecture (cs.NI) </div> </div> </dd> <dt> <a name='item14'>[14]</a> <a href ="/abs/0810.0332" title="Abstract" id="0810.0332"> arXiv:0810.0332 </a> [<a href="/pdf/0810.0332" title="Download PDF" id="pdf-0810.0332" aria-labelledby="pdf-0810.0332">pdf</a>, <a href="/format/0810.0332" title="Other formats" id="oth-0810.0332" aria-labelledby="oth-0810.0332">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Enhanced Integrated Scoring for Cleaning Dirty Texts </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&amp;query=Wong,+W">Wilson Wong</a>, <a href="https://arxiv.org/search/cs?searchtype=author&amp;query=Liu,+W">Wei Liu</a>, <a href="https://arxiv.org/search/cs?searchtype=author&amp;query=Bennamoun,+M">Mohammed Bennamoun</a></div> <div class='list-comments mathjax'><span class='descriptor'>Comments:</span> More information is available at <a href="http://explorer.csse.uwa.edu.au/reference/" rel="external noopener nofollow" class="link-external link-http">this http URL</a> </div> <div class='list-journal-ref'><span class='descriptor'>Journal-ref:</span> IJCAI Workshop on Analytics for Noisy Unstructured Text Data (AND), 2007, pages 55-62 </div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Artificial Intelligence (cs.AI)</span> </div> </div> </dd> <dt> <a name='item15'>[15]</a> <a href ="/abs/0810.0372" title="Abstract" id="0810.0372"> arXiv:0810.0372 </a> [<a href="/pdf/0810.0372" title="Download PDF" id="pdf-0810.0372" aria-labelledby="pdf-0810.0372">pdf</a>, <a href="/format/0810.0372" title="Other formats" id="oth-0810.0372" aria-labelledby="oth-0810.0372">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Optimizing Binary Code Produced by Valgrind (Project Report on Virtual Execution Environments Course - AVExe) </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&amp;query=Cabecinhas,+F">Filipe Cabecinhas</a>, <a href="https://arxiv.org/search/cs?searchtype=author&amp;query=Lopes,+N">Nuno Lopes</a>, <a href="https://arxiv.org/search/cs?searchtype=author&amp;query=Crisostomo,+R">Renato Crisostomo</a>, <a href="https://arxiv.org/search/cs?searchtype=author&amp;query=Veiga,+L">Luis Veiga</a></div> <div class='list-comments mathjax'><span class='descriptor'>Comments:</span> Technical report from INESC-ID Lisboa describing optimizations to code generation of the Valgring execution environment. Work developed in the context of a Virtual Execution Environments course (AVExe) at IST/Technical university of Lisbon </div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Programming Languages (cs.PL)</span>; Operating Systems (cs.OS) </div> </div> </dd> <dt> <a name='item16'>[16]</a> <a href ="/abs/0810.0394" title="Abstract" id="0810.0394"> arXiv:0810.0394 </a> [<a href="/pdf/0810.0394" title="Download PDF" id="pdf-0810.0394" aria-labelledby="pdf-0810.0394">pdf</a>, <a href="/format/0810.0394" title="Other formats" id="oth-0810.0394" aria-labelledby="oth-0810.0394">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Mobility Management Framework </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&amp;query=Fulop,+P">Peter Fulop</a>, <a href="https://arxiv.org/search/cs?searchtype=author&amp;query=Kovacs,+B">Benedek Kovacs</a>, <a href="https://arxiv.org/search/cs?searchtype=author&amp;query=Imre,+S">Sandor Imre</a></div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Performance (cs.PF)</span>; Networking and Internet Architecture (cs.NI) </div> </div> </dd> <dt> <a name='item17'>[17]</a> <a href ="/abs/0810.0503" title="Abstract" id="0810.0503"> arXiv:0810.0503 </a> [<a href="/pdf/0810.0503" title="Download PDF" id="pdf-0810.0503" aria-labelledby="pdf-0810.0503">pdf</a>, <a href="/format/0810.0503" title="Other formats" id="oth-0810.0503" aria-labelledby="oth-0810.0503">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> On the Capacity of One-sided Two user Gaussian Fading Broadcast Channels </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&amp;query=Jafarian,+A">Amin Jafarian</a>, <a href="https://arxiv.org/search/cs?searchtype=author&amp;query=Vishwanath,+S">Sriram Vishwanath</a></div> <div class='list-comments mathjax'><span class='descriptor'>Comments:</span> Accepted for publication at Globecom Communications Conference 2008 </div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Information Theory (cs.IT)</span> </div> </div> </dd> <dt> <a name='item18'>[18]</a> <a href ="/abs/0810.0532" title="Abstract" id="0810.0532"> arXiv:0810.0532 </a> [<a href="/pdf/0810.0532" title="Download PDF" id="pdf-0810.0532" aria-labelledby="pdf-0810.0532">pdf</a>, <a href="/format/0810.0532" title="Other formats" id="oth-0810.0532" aria-labelledby="oth-0810.0532">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Three New Complexity Results for Resource Allocation Problems </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&amp;query=de+Keijzer,+B">Bart de Keijzer</a></div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Multiagent Systems (cs.MA)</span>; Artificial Intelligence (cs.AI); Computational Complexity (cs.CC); Computer Science and Game Theory (cs.GT) </div> </div> </dd> <dt> <a name='item19'>[19]</a> <a href ="/abs/0810.0558" title="Abstract" id="0810.0558"> arXiv:0810.0558 </a> [<a href="/pdf/0810.0558" title="Download PDF" id="pdf-0810.0558" aria-labelledby="pdf-0810.0558">pdf</a>, <a href="/format/0810.0558" title="Other formats" id="oth-0810.0558" aria-labelledby="oth-0810.0558">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> The Ratio Index for Budgeted Learning, with Applications </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&amp;query=Goel,+A">Ashish Goel</a>, <a href="https://arxiv.org/search/cs?searchtype=author&amp;query=Khanna,+S">Sanjeev Khanna</a>, <a href="https://arxiv.org/search/cs?searchtype=author&amp;query=Null,+B">Brad Null</a></div> <div class='list-comments mathjax'><span class='descriptor'>Comments:</span> This paper has a substantial bug that we are trying to fix. Many thanks to Joe Halpern for pointing this bug out. Please do not cite in the meantime. Please let us know if you would like to understand and/or try to fix the bug </div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Data Structures and Algorithms (cs.DS)</span> </div> </div> </dd> <dt> <a name='item20'>[20]</a> <a href ="/abs/0810.0567" title="Abstract" id="0810.0567"> arXiv:0810.0567 </a> [<a href="/pdf/0810.0567" title="Download PDF" id="pdf-0810.0567" aria-labelledby="pdf-0810.0567">pdf</a>, <a href="/format/0810.0567" title="Other formats" id="oth-0810.0567" aria-labelledby="oth-0810.0567">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Reed-Solomon Subcodes with Nontrivial Traces: Distance Properties and Soft-Decision Decoding </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&amp;query=Thangaraj,+A">Andrew Thangaraj</a>, <a href="https://arxiv.org/search/cs?searchtype=author&amp;query=Raj,+S+J">Safitha J Raj</a></div> <div class='list-comments mathjax'><span class='descriptor'>Comments:</span> submitted to IEEE Transactions on Information Theory </div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Information Theory (cs.IT)</span> </div> </div> </dd> <dt> <a name='item21'>[21]</a> <a href ="/abs/0810.0674" title="Abstract" id="0810.0674"> arXiv:0810.0674 </a> [<a href="/pdf/0810.0674" title="Download PDF" id="pdf-0810.0674" aria-labelledby="pdf-0810.0674">pdf</a>, <a href="/format/0810.0674" title="Other formats" id="oth-0810.0674" aria-labelledby="oth-0810.0674">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Packing multiway cuts in capacitated graphs </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&amp;query=Barman,+S">Siddharth Barman</a>, <a href="https://arxiv.org/search/cs?searchtype=author&amp;query=Chawla,+S">Shuchi Chawla</a></div> <div class='list-comments mathjax'><span class='descriptor'>Comments:</span> The conference version of this paper is to appear at SODA 2009. This is the full version </div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Data Structures and Algorithms (cs.DS)</span> </div> </div> </dd> <dt> <a name='item22'>[22]</a> <a href ="/abs/0810.0745" title="Abstract" id="0810.0745"> arXiv:0810.0745 </a> [<a href="/pdf/0810.0745" title="Download PDF" id="pdf-0810.0745" aria-labelledby="pdf-0810.0745">pdf</a>, <a href="/format/0810.0745" title="Other formats" id="oth-0810.0745" aria-labelledby="oth-0810.0745">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Stackelberg Contention Games in Multiuser Networks </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&amp;query=Park,+J">Jaeok Park</a>, <a href="https://arxiv.org/search/cs?searchtype=author&amp;query=van+der+Schaar,+M">Mihaela van der Schaar</a></div> <div class='list-comments mathjax'><span class='descriptor'>Comments:</span> 30 pages, 5 figures </div> <div class='list-journal-ref'><span class='descriptor'>Journal-ref:</span> EURASIP Journal on Advances in Signal Processing, vol. 2009, Article ID 305978, 15 pages, 2009 </div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Computer Science and Game Theory (cs.GT)</span>; Networking and Internet Architecture (cs.NI) </div> </div> </dd> <dt> <a name='item23'>[23]</a> <a href ="/abs/0810.0747" title="Abstract" id="0810.0747"> arXiv:0810.0747 </a> [<a href="/pdf/0810.0747" title="Download PDF" id="pdf-0810.0747" aria-labelledby="pdf-0810.0747">pdf</a>, <a href="/format/0810.0747" title="Other formats" id="oth-0810.0747" aria-labelledby="oth-0810.0747">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> A New Upper Bound on the Capacity of a Class of Primitive Relay Channels </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&amp;query=Tandon,+R">Ravi Tandon</a>, <a href="https://arxiv.org/search/cs?searchtype=author&amp;query=Ulukus,+S">Sennur Ulukus</a></div> <div class='list-comments mathjax'><span class='descriptor'>Comments:</span> To appear in Proceedings of 46th Annual Allerton Conference on Communication, Control and Computing, Sept. 2008 </div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Information Theory (cs.IT)</span>; Artificial Intelligence (cs.AI) </div> </div> </dd> <dt> <a name='item24'>[24]</a> <a href ="/abs/0810.0753" title="Abstract" id="0810.0753"> arXiv:0810.0753 </a> [<a href="/pdf/0810.0753" title="Download PDF" id="pdf-0810.0753" aria-labelledby="pdf-0810.0753">pdf</a>, <a href="/format/0810.0753" title="Other formats" id="oth-0810.0753" aria-labelledby="oth-0810.0753">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Definition and Implementation of a Points-To Analysis for C-like Languages </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&amp;query=Soffia,+S">Stefano Soffia</a></div> <div class='list-comments mathjax'><span class='descriptor'>Comments:</span> 135 pages </div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Programming Languages (cs.PL)</span> </div> </div> </dd> <dt> <a name='item25'>[25]</a> <a href ="/abs/0810.0763" title="Abstract" id="0810.0763"> arXiv:0810.0763 </a> [<a href="/pdf/0810.0763" title="Download PDF" id="pdf-0810.0763" aria-labelledby="pdf-0810.0763">pdf</a>, <a href="/format/0810.0763" title="Other formats" id="oth-0810.0763" aria-labelledby="oth-0810.0763">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Errorless Codes for Over-loaded CDMA with Active User Detection </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&amp;query=Pad,+P">Pedram Pad</a>, <a href="https://arxiv.org/search/cs?searchtype=author&amp;query=Soltanolkotabi,+M">Mahdi Soltanolkotabi</a>, <a href="https://arxiv.org/search/cs?searchtype=author&amp;query=Hadikhanlou,+S">Saeed Hadikhanlou</a>, <a href="https://arxiv.org/search/cs?searchtype=author&amp;query=Enayati,+A">Arash Enayati</a>, <a href="https://arxiv.org/search/cs?searchtype=author&amp;query=Marvasti,+F">Farokh Marvasti</a></div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Information Theory (cs.IT)</span> </div> </div> </dd> <dt> <a name='item26'>[26]</a> <a href ="/abs/0810.0764" title="Abstract" id="0810.0764"> arXiv:0810.0764 </a> [<a href="/pdf/0810.0764" title="Download PDF" id="pdf-0810.0764" aria-labelledby="pdf-0810.0764">pdf</a>, <a href="/format/0810.0764" title="Other formats" id="oth-0810.0764" aria-labelledby="oth-0810.0764">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> A New Method for Constructing Large Size WBE Codes with Low Complexity ML Decoder </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&amp;query=Faraji,+M+J">Mohammad Javad Faraji</a>, <a href="https://arxiv.org/search/cs?searchtype=author&amp;query=Pad,+P">Pedram Pad</a>, <a href="https://arxiv.org/search/cs?searchtype=author&amp;query=Marvasti,+F">Farokh Marvasti</a></div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Information Theory (cs.IT)</span> </div> </div> </dd> <dt> <a name='item27'>[27]</a> <a href ="/abs/0810.0785" title="Abstract" id="0810.0785"> arXiv:0810.0785 </a> [<a href="/pdf/0810.0785" title="Download PDF" id="pdf-0810.0785" aria-labelledby="pdf-0810.0785">pdf</a>, <a href="/format/0810.0785" title="Other formats" id="oth-0810.0785" aria-labelledby="oth-0810.0785">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Novel Bounds on the Capacity of the Binary Deletion Channel </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&amp;query=Fertonani,+D">Dario Fertonani</a>, <a href="https://arxiv.org/search/cs?searchtype=author&amp;query=Duman,+T+M">Tolga M. Duman</a></div> <div class='list-comments mathjax'><span class='descriptor'>Comments:</span> Submitted to IEEE Transactions on Information Theory </div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Information Theory (cs.IT)</span> </div> </div> </dd> <dt> <a name='item28'>[28]</a> <a href ="/abs/0810.0800" title="Abstract" id="0810.0800"> arXiv:0810.0800 </a> [<a href="/pdf/0810.0800" title="Download PDF" id="pdf-0810.0800" aria-labelledby="pdf-0810.0800">pdf</a>, <a href="/format/0810.0800" title="Other formats" id="oth-0810.0800" aria-labelledby="oth-0810.0800">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Condition Numbers of Gaussian Random Matrices </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&amp;query=Chen,+Z">Zizhong Chen</a>, <a href="https://arxiv.org/search/cs?searchtype=author&amp;query=Dongarra,+J">Jack Dongarra</a></div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Numerical Analysis (math.NA)</span> </div> </div> </dd> <dt> <a name='item29'>[29]</a> <a href ="/abs/0810.0830" title="Abstract" id="0810.0830"> arXiv:0810.0830 </a> [<a href="/pdf/0810.0830" title="Download PDF" id="pdf-0810.0830" aria-labelledby="pdf-0810.0830">pdf</a>, <a href="/format/0810.0830" title="Other formats" id="oth-0810.0830" aria-labelledby="oth-0810.0830">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Stiffness Analysis Of Multi-Chain Parallel Robotic Systems </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&amp;query=Pashkevich,+A">Anatoly Pashkevich</a> (IRCCyN), <a href="https://arxiv.org/search/cs?searchtype=author&amp;query=Chablat,+D">Damien Chablat</a> (IRCCyN), <a href="https://arxiv.org/search/cs?searchtype=author&amp;query=Wenger,+P">Philippe Wenger</a> (IRCCyN)</div> <div class='list-journal-ref'><span class='descriptor'>Journal-ref:</span> 9th IFAC Workshop on Intelligent Manufacturing Systems, France (2008) </div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Robotics (cs.RO)</span>; Classical Physics (physics.class-ph) </div> </div> </dd> <dt> <a name='item30'>[30]</a> <a href ="/abs/0810.0870" title="Abstract" id="0810.0870"> arXiv:0810.0870 </a> [<a href="/pdf/0810.0870" title="Download PDF" id="pdf-0810.0870" aria-labelledby="pdf-0810.0870">pdf</a>, <a href="/format/0810.0870" title="Other formats" id="oth-0810.0870" aria-labelledby="oth-0810.0870">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Cognitive Radio with Partial Channel State Information at the Transmitter </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&amp;query=Lin,+P">Pin-Hsun Lin</a>, <a href="https://arxiv.org/search/cs?searchtype=author&amp;query=Lin,+S">Shih-Chun Lin</a>, <a href="https://arxiv.org/search/cs?searchtype=author&amp;query=Lee,+C">Chung-Pi Lee</a>, <a href="https://arxiv.org/search/cs?searchtype=author&amp;query=Su,+H">Hsuan-Jung Su</a></div> <div class='list-comments mathjax'><span class='descriptor'>Comments:</span> resubmitted to IEEE Transaction on Wireless Communications, May 2009 </div> <div class='list-journal-ref'><span class='descriptor'>Journal-ref:</span> IEEE Transactions on Wireless Communications, vol. 9, no. 11, pp. 3402-3413, Nov. 2010 </div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Information Theory (cs.IT)</span> </div> </div> </dd> <dt> <a name='item31'>[31]</a> <a href ="/abs/0810.0874" title="Abstract" id="0810.0874"> arXiv:0810.0874 </a> [<a href="/pdf/0810.0874" title="Download PDF" id="pdf-0810.0874" aria-labelledby="pdf-0810.0874">pdf</a>, <a href="/format/0810.0874" title="Other formats" id="oth-0810.0874" aria-labelledby="oth-0810.0874">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Software Engineering &amp; Systems Design Nature </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&amp;query=Sorudeykin,+K+A">Kirill A Sorudeykin</a></div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Software Engineering (cs.SE)</span> </div> </div> </dd> <dt> <a name='item32'>[32]</a> <a href ="/abs/0810.0877" title="Abstract" id="0810.0877"> arXiv:0810.0877 </a> [<a href="/pdf/0810.0877" title="Download PDF" id="pdf-0810.0877" aria-labelledby="pdf-0810.0877">pdf</a>, <a href="/format/0810.0877" title="Other formats" id="oth-0810.0877" aria-labelledby="oth-0810.0877">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Bias-Variance Techniques for Monte Carlo Optimization: Cross-validation for the CE Method </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&amp;query=Rajnarayan,+D">Dev Rajnarayan</a>, <a href="https://arxiv.org/search/cs?searchtype=author&amp;query=Wolpert,+D">David Wolpert</a></div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Numerical Analysis (math.NA)</span>; Machine Learning (cs.LG) </div> </div> </dd> <dt> <a name='item33'>[33]</a> <a href ="/abs/0810.0882" title="Abstract" id="0810.0882"> arXiv:0810.0882 </a> [<a href="/pdf/0810.0882" title="Download PDF" id="pdf-0810.0882" aria-labelledby="pdf-0810.0882">pdf</a>, <a href="/format/0810.0882" title="Other formats" id="oth-0810.0882" aria-labelledby="oth-0810.0882">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Asymptotic Eigenvalue Moments of Wishart-Type Random Matrix Without Ergodicity in One Channel Realization </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&amp;query=Hwang,+C">Chien-Hwa Hwang</a></div> <div class='list-comments mathjax'><span class='descriptor'>Comments:</span> 36 pages, 6 figures, submitted to IEEE Transactions on Information Theory, Oct. 2008 </div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Information Theory (cs.IT)</span> </div> </div> </dd> <dt> <a name='item34'>[34]</a> <a href ="/abs/0810.0883" title="Abstract" id="0810.0883"> arXiv:0810.0883 </a> [<a href="/pdf/0810.0883" title="Download PDF" id="pdf-0810.0883" aria-labelledby="pdf-0810.0883">pdf</a>, <a href="/format/0810.0883" title="Other formats" id="oth-0810.0883" aria-labelledby="oth-0810.0883">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Asymptotic Performance of Linear Receivers in MIMO Fading Channels </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&amp;query=Kumar,+K+R">K. Raj Kumar</a>, <a href="https://arxiv.org/search/cs?searchtype=author&amp;query=Caire,+G">G. Caire</a>, <a href="https://arxiv.org/search/cs?searchtype=author&amp;query=Moustakas,+A+L">A. L. Moustakas</a></div> <div class='list-comments mathjax'><span class='descriptor'>Comments:</span> 48 pages, Submitted to IEEE Transactions on Information Theory </div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Information Theory (cs.IT)</span> </div> </div> </dd> <dt> <a name='item35'>[35]</a> <a href ="/abs/0810.0906" title="Abstract" id="0810.0906"> arXiv:0810.0906 </a> [<a href="/pdf/0810.0906" title="Download PDF" id="pdf-0810.0906" aria-labelledby="pdf-0810.0906">pdf</a>, <a href="/format/0810.0906" title="Other formats" id="oth-0810.0906" aria-labelledby="oth-0810.0906">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> A linear time algorithm for L(2,1)-labeling of trees </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&amp;query=Hasunuma,+T">Toru Hasunuma</a>, <a href="https://arxiv.org/search/cs?searchtype=author&amp;query=Ishii,+T">Toshimasa Ishii</a>, <a href="https://arxiv.org/search/cs?searchtype=author&amp;query=Ono,+H">Hirotaka Ono</a>, <a href="https://arxiv.org/search/cs?searchtype=author&amp;query=Uno,+Y">Yushi Uno</a></div> <div class='list-comments mathjax'><span class='descriptor'>Comments:</span> 23 pages, 3 figures </div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Data Structures and Algorithms (cs.DS)</span> </div> </div> </dd> <dt> <a name='item36'>[36]</a> <a href ="/abs/0810.1018" title="Abstract" id="0810.1018"> arXiv:0810.1018 </a> [<a href="/pdf/0810.1018" title="Download PDF" id="pdf-0810.1018" aria-labelledby="pdf-0810.1018">pdf</a>, <a href="/format/0810.1018" title="Other formats" id="oth-0810.1018" aria-labelledby="oth-0810.1018">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> A simple constant-probability RP reduction from NP to Parity P </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&amp;query=Moore,+C">Cristopher Moore</a>, <a href="https://arxiv.org/search/cs?searchtype=author&amp;query=Russell,+A">Alexander Russell</a></div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Computational Complexity (cs.CC)</span> </div> </div> </dd> <dt> <a name='item37'>[37]</a> <a href ="/abs/0810.1097" title="Abstract" id="0810.1097"> arXiv:0810.1097 </a> [<a href="/pdf/0810.1097" title="Download PDF" id="pdf-0810.1097" aria-labelledby="pdf-0810.1097">pdf</a>, <a href="/format/0810.1097" title="Other formats" id="oth-0810.1097" aria-labelledby="oth-0810.1097">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Simulation of Laser Beam Propagation With a Paraxial Model in a Tilted Frame </div> <div class='list-authors'><a href="https://arxiv.org/search/math?searchtype=author&amp;query=Doumic,+M">Marie Doumic</a> (INRIA Rocquencourt), <a href="https://arxiv.org/search/math?searchtype=author&amp;query=Duboc,+F">Fr茅d茅ric Duboc</a> (CEA/DAM), <a href="https://arxiv.org/search/math?searchtype=author&amp;query=Golse,+F">Fran莽ois Golse</a> (CMLS-EcolePolytechnique), <a href="https://arxiv.org/search/math?searchtype=author&amp;query=Sentis,+R">R茅mi Sentis</a> (CEA/DAM)</div> <div class='list-journal-ref'><span class='descriptor'>Journal-ref:</span> Journal of Computational Physics 228, 3 (2009) 861--880 </div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Numerical Analysis (math.NA)</span>; Mathematical Physics (math-ph) </div> </div> </dd> <dt> <a name='item38'>[38]</a> <a href ="/abs/0810.1103" title="Abstract" id="0810.1103"> arXiv:0810.1103 </a> [<a href="/pdf/0810.1103" title="Download PDF" id="pdf-0810.1103" aria-labelledby="pdf-0810.1103">pdf</a>, <a href="/format/0810.1103" title="Other formats" id="oth-0810.1103" aria-labelledby="oth-0810.1103">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Channel and Multiuser Diversities in Wireless Systems: Delay-Energy Tradeoff </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&amp;query=Chaporkar,+P">Prasanna Chaporkar</a>, <a href="https://arxiv.org/search/cs?searchtype=author&amp;query=Kansanen,+K">Kimmo Kansanen</a>, <a href="https://arxiv.org/search/cs?searchtype=author&amp;query=M%C3%BCller,+R+R">Ralf R. M眉ller</a></div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Information Theory (cs.IT)</span> </div> </div> </dd> <dt> <a name='item39'>[39]</a> <a href ="/abs/0810.1105" title="Abstract" id="0810.1105"> arXiv:0810.1105 </a> [<a href="/pdf/0810.1105" title="Download PDF" id="pdf-0810.1105" aria-labelledby="pdf-0810.1105">pdf</a>, <a href="/format/0810.1105" title="Other formats" id="oth-0810.1105" aria-labelledby="oth-0810.1105">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Low-Density Parity-Check Codes Which Can Correct Three Errors Under Iterative Decoding </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&amp;query=Chilappagari,+S+K">Shashi Kiran Chilappagari</a>, <a href="https://arxiv.org/search/cs?searchtype=author&amp;query=Krishnan,+A+R">Anantha Raman Krishnan</a>, <a href="https://arxiv.org/search/cs?searchtype=author&amp;query=Vasic,+B">Bane Vasic</a>, <a href="https://arxiv.org/search/cs?searchtype=author&amp;query=Marcellin,+M+W">Michael W. Marcellin</a></div> <div class='list-comments mathjax'><span class='descriptor'>Comments:</span> 25 pages. 11 Figures. Part of the work was presented at the Information Theory Workshop (ITW), May 5-9 2008, Porto, Portugal. submitted to IEEE Transactions on Information Theory </div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Information Theory (cs.IT)</span> </div> </div> </dd> <dt> <a name='item40'>[40]</a> <a href ="/abs/0810.1106" title="Abstract" id="0810.1106"> arXiv:0810.1106 </a> [<a href="/pdf/0810.1106" title="Download PDF" id="pdf-0810.1106" aria-labelledby="pdf-0810.1106">pdf</a>, <a href="/format/0810.1106" title="Other formats" id="oth-0810.1106" aria-labelledby="oth-0810.1106">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> On the expressiveness of single-pass instruction sequences </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&amp;query=Bergstra,+J">J.A. Bergstra</a>, <a href="https://arxiv.org/search/cs?searchtype=author&amp;query=Middelburg,+C">C.A. Middelburg</a></div> <div class='list-comments mathjax'><span class='descriptor'>Comments:</span> 14 pages; error corrected, acknowledgement added; another error corrected, another acknowledgement added </div> <div class='list-journal-ref'><span class='descriptor'>Journal-ref:</span> Theory of Computing Systems, 50(2):313--328, 2012 </div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Programming Languages (cs.PL)</span> </div> </div> </dd> <dt> <a name='item41'>[41]</a> <a href ="/abs/0810.1119" title="Abstract" id="0810.1119"> arXiv:0810.1119 </a> [<a href="/pdf/0810.1119" title="Download PDF" id="pdf-0810.1119" aria-labelledby="pdf-0810.1119">pdf</a>, <a href="/format/0810.1119" title="Other formats" id="oth-0810.1119" aria-labelledby="oth-0810.1119">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Gaussian Belief Propagation for Solving Systems of Linear Equations: Theory and Application </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&amp;query=Shental,+O">Ori Shental</a>, <a href="https://arxiv.org/search/cs?searchtype=author&amp;query=Bickson,+D">Danny Bickson</a>, <a href="https://arxiv.org/search/cs?searchtype=author&amp;query=Siegel,+P+H">Paul H. Siegel</a>, <a href="https://arxiv.org/search/cs?searchtype=author&amp;query=Wolf,+J+K">Jack K. Wolf</a>, <a href="https://arxiv.org/search/cs?searchtype=author&amp;query=Dolev,+D">Danny Dolev</a></div> <div class='list-comments mathjax'><span class='descriptor'>Comments:</span> Submitted to IEEE Transactions on Information Theory </div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Information Theory (cs.IT)</span> </div> </div> </dd> <dt> <a name='item42'>[42]</a> <a href ="/abs/0810.1127" title="Abstract" id="0810.1127"> arXiv:0810.1127 </a> [<a href="/pdf/0810.1127" title="Download PDF" id="pdf-0810.1127" aria-labelledby="pdf-0810.1127">pdf</a>, <a href="/format/0810.1127" title="Other formats" id="oth-0810.1127" aria-labelledby="oth-0810.1127">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> A robust spectral method for finding lumpings and meta stable states of non-reversible Markov chains </div> <div class='list-authors'><a href="https://arxiv.org/search/math?searchtype=author&amp;query=Jacobi,+M+N">Martin Nilsson Jacobi</a></div> <div class='list-comments mathjax'><span class='descriptor'>Comments:</span> 10 pages, 7 figures </div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Numerical Analysis (math.NA)</span> </div> </div> </dd> <dt> <a name='item43'>[43]</a> <a href ="/abs/0810.1132" title="Abstract" id="0810.1132"> arXiv:0810.1132 </a> [<a href="/pdf/0810.1132" title="Download PDF" id="pdf-0810.1132" aria-labelledby="pdf-0810.1132">pdf</a>, <a href="/format/0810.1132" title="Other formats" id="oth-0810.1132" aria-labelledby="oth-0810.1132">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Maximally Radio-Disjoint Multipath Routing for Wireless Multimedia Sensor Networks </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&amp;query=Maimour,+M">Moufida Maimour</a> (CRAN)</div> <div class='list-journal-ref'><span class='descriptor'>Journal-ref:</span> Fourth ACM International Workshop on Wireless Multimedia Networking and erformance Modeling, Vancouver : Canada (2008) </div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Networking and Internet Architecture (cs.NI)</span> </div> </div> </dd> <dt> <a name='item44'>[44]</a> <a href ="/abs/0810.1139" title="Abstract" id="0810.1139"> arXiv:0810.1139 </a> [<a href="/pdf/0810.1139" title="Download PDF" id="pdf-0810.1139" aria-labelledby="pdf-0810.1139">pdf</a>, <a href="/format/0810.1139" title="Other formats" id="oth-0810.1139" aria-labelledby="oth-0810.1139">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Load Repartition for Congestion Control in Multimedia Wireless Sensor Networks with Multipath Routing </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&amp;query=Maimour,+M">Moufida Maimour</a> (CRAN), <a href="https://arxiv.org/search/cs?searchtype=author&amp;query=Pham,+C">Congduc Pham</a> (LIUPPA), <a href="https://arxiv.org/search/cs?searchtype=author&amp;query=Amelot,+J">Julien Amelot</a> (CRAN)</div> <div class='list-journal-ref'><span class='descriptor'>Journal-ref:</span> 3rd International Symposium on Wireless Pervasive Computing, ISWPC 2008, Santorini : Gr\`ece (2008) </div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Networking and Internet Architecture (cs.NI)</span> </div> </div> </dd> <dt> <a name='item45'>[45]</a> <a href ="/abs/0810.1146" title="Abstract" id="0810.1146"> arXiv:0810.1146 </a> [<a href="/pdf/0810.1146" title="Download PDF" id="pdf-0810.1146" aria-labelledby="pdf-0810.1146">pdf</a>, <a href="/format/0810.1146" title="Other formats" id="oth-0810.1146" aria-labelledby="oth-0810.1146">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Analysis of a class of non linear subdivision schemes and associated multi-resolution transforms </div> <div class='list-authors'><a href="https://arxiv.org/search/math?searchtype=author&amp;query=Amat,+S">S. Amat</a>, <a href="https://arxiv.org/search/math?searchtype=author&amp;query=Dadourian,+K">K. Dadourian</a>, <a href="https://arxiv.org/search/math?searchtype=author&amp;query=Liandrat,+J">J. Liandrat</a></div> <div class='list-comments mathjax'><span class='descriptor'>Comments:</span> 25 pages, 4 figures </div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Numerical Analysis (math.NA)</span> </div> </div> </dd> <dt> <a name='item46'>[46]</a> <a href ="/abs/0810.1151" title="Abstract" id="0810.1151"> arXiv:0810.1151 </a> [<a href="/pdf/0810.1151" title="Download PDF" id="pdf-0810.1151" aria-labelledby="pdf-0810.1151">pdf</a>, <a href="/format/0810.1151" title="Other formats" id="oth-0810.1151" aria-labelledby="oth-0810.1151">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Periodic Single-Pass Instruction Sequences </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&amp;query=Bergstra,+J+A">Jan A. Bergstra</a>, <a href="https://arxiv.org/search/cs?searchtype=author&amp;query=Ponse,+A">Alban Ponse</a></div> <div class='list-comments mathjax'><span class='descriptor'>Comments:</span> 16 pages, 3 tables, New title </div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Programming Languages (cs.PL)</span> </div> </div> </dd> <dt> <a name='item47'>[47]</a> <a href ="/abs/0810.1186" title="Abstract" id="0810.1186"> arXiv:0810.1186 </a> [<a href="/pdf/0810.1186" title="Download PDF" id="pdf-0810.1186" aria-labelledby="pdf-0810.1186">pdf</a>, <a href="/format/0810.1186" title="Other formats" id="oth-0810.1186" aria-labelledby="oth-0810.1186">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> On-the-fly Macros </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&amp;query=Chen,+H">Hubie Chen</a>, <a href="https://arxiv.org/search/cs?searchtype=author&amp;query=Gimenez,+O">Omer Gimenez</a></div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Artificial Intelligence (cs.AI)</span> </div> </div> </dd> <dt> <a name='item48'>[48]</a> <a href ="/abs/0810.1187" title="Abstract" id="0810.1187"> arXiv:0810.1187 </a> [<a href="/pdf/0810.1187" title="Download PDF" id="pdf-0810.1187" aria-labelledby="pdf-0810.1187">pdf</a>, <a href="/format/0810.1187" title="Other formats" id="oth-0810.1187" aria-labelledby="oth-0810.1187">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Interference Alignment for Secrecy </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&amp;query=Koyluoglu,+O+O">Onur Ozan Koyluoglu</a>, <a href="https://arxiv.org/search/cs?searchtype=author&amp;query=Gamal,+H+E">Hesham El Gamal</a>, <a href="https://arxiv.org/search/cs?searchtype=author&amp;query=Lai,+L">Lifeng Lai</a>, <a href="https://arxiv.org/search/cs?searchtype=author&amp;query=Poor,+H+V">H. Vincent Poor</a></div> <div class='list-comments mathjax'><span class='descriptor'>Comments:</span> Submitted to IEEE Transactions on Information Theory </div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Information Theory (cs.IT)</span> </div> </div> </dd> <dt> <a name='item49'>[49]</a> <a href ="/abs/0810.1197" title="Abstract" id="0810.1197"> arXiv:0810.1197 </a> [<a href="/pdf/0810.1197" title="Download PDF" id="pdf-0810.1197" aria-labelledby="pdf-0810.1197">pdf</a>, <a href="/format/0810.1197" title="Other formats" id="oth-0810.1197" aria-labelledby="oth-0810.1197">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Construction of Near-Optimum Burst Erasure Correcting Low-Density Parity-Check Codes </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&amp;query=Paolini,+E">E. Paolini</a>, <a href="https://arxiv.org/search/cs?searchtype=author&amp;query=Chiani,+M">M. Chiani</a></div> <div class='list-comments mathjax'><span class='descriptor'>Comments:</span> 15 pages, 4 figures. IEEE Trans. on Communications, accepted (submitted in Feb. 2007) </div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Information Theory (cs.IT)</span> </div> </div> </dd> <dt> <a name='item50'>[50]</a> <a href ="/abs/0810.1199" title="Abstract" id="0810.1199"> arXiv:0810.1199 </a> [<a href="/pdf/0810.1199" title="Download PDF" id="pdf-0810.1199" aria-labelledby="pdf-0810.1199">pdf</a>, <a href="/format/0810.1199" title="Other formats" id="oth-0810.1199" aria-labelledby="oth-0810.1199">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Une grammaire formelle du cr茅ole martiniquais pour la g茅n茅ration automatique </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&amp;query=Vaillant,+P">Pascal Vaillant</a></div> <div class='list-comments mathjax'><span class='descriptor'>Comments:</span> In French. 10 pages, 4 figures, LaTeX 2e using EPSF and custom package <a href="http://Taln2003.sty" rel="external noopener nofollow" class="link-external link-http">this http URL</a> (JC/PZ, ATALA). Proceedings of the 10th annual French-speaking conference on Natural Language Processing: `Traitement Automatique des Langues Naturelles&#39; (TALN 2003), Batz-sur-mer, France, 10-14 June 2003 </div> <div class='list-journal-ref'><span class='descriptor'>Journal-ref:</span> Actes de la 10eme conference annuelle sur le Traitement Automatique des Langues Naturelles (TALN 2003), p. 255-264. Batz-sur-mer, France, 10-14 juin 2003 </div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Computation and Language (cs.CL)</span> </div> </div> </dd> </dl> <div class='paging'>Total of 321 entries : <span>1-50</span> <a href=/list/cs/2008-10?skip=50&amp;show=50>51-100</a> <a href=/list/cs/2008-10?skip=100&amp;show=50>101-150</a> <a href=/list/cs/2008-10?skip=150&amp;show=50>151-200</a> <span>...</span> <a href=/list/cs/2008-10?skip=300&amp;show=50>301-321</a> </div> <div class='morefewer'>Showing up to 50 entries per page: <a href=/list/cs/2008-10?skip=0&amp;show=25 rel="nofollow"> fewer</a> | <a href=/list/cs/2008-10?skip=0&amp;show=100 rel="nofollow"> more</a> | <a href=/list/cs/2008-10?skip=0&amp;show=2000 rel="nofollow"> all</a> </div> </div> </div> </div> </main> <footer style="clear: both;"> <div class="columns is-desktop" role="navigation" aria-label="Secondary" style="margin: -0.75em -0.75em 0.75em -0.75em"> <!-- Macro-Column 1 --> <div class="column" style="padding: 0;"> <div class="columns"> <div class="column"> <ul style="list-style: none; line-height: 2;"> <li><a href="https://info.arxiv.org/about">About</a></li> <li><a href="https://info.arxiv.org/help">Help</a></li> </ul> </div> <div class="column"> <ul style="list-style: none; line-height: 2;"> <li> <svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 512 512" class="icon filter-black" role="presentation"><title>contact arXiv</title><desc>Click here to contact arXiv</desc><path d="M502.3 190.8c3.9-3.1 9.7-.2 9.7 4.7V400c0 26.5-21.5 48-48 48H48c-26.5 0-48-21.5-48-48V195.6c0-5 5.7-7.8 9.7-4.7 22.4 17.4 52.1 39.5 154.1 113.6 21.1 15.4 56.7 47.8 92.2 47.6 35.7.3 72-32.8 92.3-47.6 102-74.1 131.6-96.3 154-113.7zM256 320c23.2.4 56.6-29.2 73.4-41.4 132.7-96.3 142.8-104.7 173.4-128.7 5.8-4.5 9.2-11.5 9.2-18.9v-19c0-26.5-21.5-48-48-48H48C21.5 64 0 85.5 0 112v19c0 7.4 3.4 14.3 9.2 18.9 30.6 23.9 40.7 32.4 173.4 128.7 16.8 12.2 50.2 41.8 73.4 41.4z"/></svg> <a href="https://info.arxiv.org/help/contact.html"> Contact</a> </li> <li> <svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 512 512" class="icon filter-black" role="presentation"><title>subscribe to arXiv mailings</title><desc>Click here to subscribe</desc><path d="M476 3.2L12.5 270.6c-18.1 10.4-15.8 35.6 2.2 43.2L121 358.4l287.3-253.2c5.5-4.9 13.3 2.6 8.6 8.3L176 407v80.5c0 23.6 28.5 32.9 42.5 15.8L282 426l124.6 52.2c14.2 6 30.4-2.9 33-18.2l72-432C515 7.8 493.3-6.8 476 3.2z"/></svg> <a href="https://info.arxiv.org/help/subscribe"> Subscribe</a> </li> </ul> </div> </div> </div> <!-- End Macro-Column 1 --> <!-- Macro-Column 2 --> <div class="column" style="padding: 0;"> <div class="columns"> <div class="column"> <ul style="list-style: none; line-height: 2;"> <li><a href="https://info.arxiv.org/help/license/index.html">Copyright</a></li> <li><a href="https://info.arxiv.org/help/policies/privacy_policy.html">Privacy Policy</a></li> </ul> </div> <div class="column sorry-app-links"> <ul style="list-style: none; line-height: 2;"> <li><a href="https://info.arxiv.org/help/web_accessibility.html">Web Accessibility Assistance</a></li> <li> <p class="help"> <a class="a11y-main-link" href="https://status.arxiv.org" target="_blank">arXiv Operational Status <svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 256 512" class="icon filter-dark_grey" role="presentation"><path d="M224.3 273l-136 136c-9.4 9.4-24.6 9.4-33.9 0l-22.6-22.6c-9.4-9.4-9.4-24.6 0-33.9l96.4-96.4-96.4-96.4c-9.4-9.4-9.4-24.6 0-33.9L54.3 103c9.4-9.4 24.6-9.4 33.9 0l136 136c9.5 9.4 9.5 24.6.1 34z"/></svg></a><br> Get status notifications via <a class="is-link" href="https://subscribe.sorryapp.com/24846f03/email/new" target="_blank"><svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 512 512" class="icon filter-black" role="presentation"><path d="M502.3 190.8c3.9-3.1 9.7-.2 9.7 4.7V400c0 26.5-21.5 48-48 48H48c-26.5 0-48-21.5-48-48V195.6c0-5 5.7-7.8 9.7-4.7 22.4 17.4 52.1 39.5 154.1 113.6 21.1 15.4 56.7 47.8 92.2 47.6 35.7.3 72-32.8 92.3-47.6 102-74.1 131.6-96.3 154-113.7zM256 320c23.2.4 56.6-29.2 73.4-41.4 132.7-96.3 142.8-104.7 173.4-128.7 5.8-4.5 9.2-11.5 9.2-18.9v-19c0-26.5-21.5-48-48-48H48C21.5 64 0 85.5 0 112v19c0 7.4 3.4 14.3 9.2 18.9 30.6 23.9 40.7 32.4 173.4 128.7 16.8 12.2 50.2 41.8 73.4 41.4z"/></svg>email</a> or <a class="is-link" href="https://subscribe.sorryapp.com/24846f03/slack/new" target="_blank"><svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 448 512" class="icon filter-black" role="presentation"><path d="M94.12 315.1c0 25.9-21.16 47.06-47.06 47.06S0 341 0 315.1c0-25.9 21.16-47.06 47.06-47.06h47.06v47.06zm23.72 0c0-25.9 21.16-47.06 47.06-47.06s47.06 21.16 47.06 47.06v117.84c0 25.9-21.16 47.06-47.06 47.06s-47.06-21.16-47.06-47.06V315.1zm47.06-188.98c-25.9 0-47.06-21.16-47.06-47.06S139 32 164.9 32s47.06 21.16 47.06 47.06v47.06H164.9zm0 23.72c25.9 0 47.06 21.16 47.06 47.06s-21.16 47.06-47.06 47.06H47.06C21.16 243.96 0 222.8 0 196.9s21.16-47.06 47.06-47.06H164.9zm188.98 47.06c0-25.9 21.16-47.06 47.06-47.06 25.9 0 47.06 21.16 47.06 47.06s-21.16 47.06-47.06 47.06h-47.06V196.9zm-23.72 0c0 25.9-21.16 47.06-47.06 47.06-25.9 0-47.06-21.16-47.06-47.06V79.06c0-25.9 21.16-47.06 47.06-47.06 25.9 0 47.06 21.16 47.06 47.06V196.9zM283.1 385.88c25.9 0 47.06 21.16 47.06 47.06 0 25.9-21.16 47.06-47.06 47.06-25.9 0-47.06-21.16-47.06-47.06v-47.06h47.06zm0-23.72c-25.9 0-47.06-21.16-47.06-47.06 0-25.9 21.16-47.06 47.06-47.06h117.84c25.9 0 47.06 21.16 47.06 47.06 0 25.9-21.16 47.06-47.06 47.06H283.1z"/></svg>slack</a> </p> </li> </ul> </div> </div> </div> <!-- end MetaColumn 2 --> <!-- End Macro-Column 2 --> </div> </footer> </div> <script src="/static/base/1.0.1/js/member_acknowledgement.js"></script> </body> </html>

Pages: 1 2 3 4 5 6 7 8 9 10