HTML Export for Dagstuhl Seminar Proceedings, Volume 7071

Copy to Clipboard Download

<h2>Dagstuhl Seminar Proceedings, Volume 7071, </h2>
<ul>
<li>
    <span class="authors">Andreas Frommer, Michael W. Mahoney, and Daniel B. Szyld</span>
    <span class="title">07071 Abstracts Collection – Web Information Retrieval and Linear Algebra Algorithms</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.07071.1">10.4230/DagSemProc.07071.1</a>
</li>
<li>
    <span class="authors">Andreas Frommer, Michael W. Mahoney, and Daniel B. Szyld</span>
    <span class="title">07071 Report on Dagstuhl Seminar – Web Information Retrieval and Linear Algebra Algorithms</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.07071.2">10.4230/DagSemProc.07071.2</a>
</li>
<li>
    <span class="authors">Paolo Boldi, Massimo Santini, and Sebastiano Vigna</span>
    <span class="title">A Deeper Investigation of PageRank as a Function of the Damping Factor</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.07071.3">10.4230/DagSemProc.07071.3</a>
</li>
<li>
    <span class="authors">Philip A. Knight and Daniel Ruiz</span>
    <span class="title">A Fast Algorithm for Matrix Balancing</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.07071.4">10.4230/DagSemProc.07071.4</a>
</li>
<li>
    <span class="authors">Andrew P. Gray, Chen Greif, and Tracy Lau</span>
    <span class="title">An Inner/Outer Stationary Iteration for Computing PageRank</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.07071.5">10.4230/DagSemProc.07071.5</a>
</li>
<li>
    <span class="authors">Giorgios Kollias and Efstratios Gallopoulos</span>
    <span class="title">Asynchronous Computation of PageRank computation in an interactive multithreading environment</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.07071.6">10.4230/DagSemProc.07071.6</a>
</li>
<li>
    <span class="authors">Ivo Marek, Ivana Pultarová, and Petr Mayer</span>
    <span class="title">Convergence of iterative aggregation/disaggregation methods based on splittings with cyclic iteration matrices</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.07071.7">10.4230/DagSemProc.07071.7</a>
</li>
<li>
    <span class="authors">Julia Luxenburger and Gerhard Weikum</span>
    <span class="title">Exploiting Community Behavior for Enhanced Link Analysis and Web Search</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.07071.8">10.4230/DagSemProc.07071.8</a>
</li>
<li>
    <span class="authors">Claude Brezinski and Michela Redivo-Zaglia</span>
    <span class="title">Extrapolation and minimization procedures for the PageRank vector</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.07071.9">10.4230/DagSemProc.07071.9</a>
</li>
<li>
    <span class="authors">Stefano Serra Capizzano</span>
    <span class="title">Google Pageranking Problem: The Model and the Analysis</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.07071.10">10.4230/DagSemProc.07071.10</a>
</li>
<li>
    <span class="authors">Catherine Fraikin and Paul Van Dooren</span>
    <span class="title">Graph matching with type constraints on nodes and edges</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.07071.11">10.4230/DagSemProc.07071.11</a>
</li>
<li>
    <span class="authors">Peter Buchholz</span>
    <span class="title">Iteration at Different Levels: Multi-Level Methods fro Structured Markov Chains</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.07071.12">10.4230/DagSemProc.07071.12</a>
</li>
<li>
    <span class="authors">Giorgios Kollias and Efstratios Gallopoulos</span>
    <span class="title">Multidamping simulation framework for link-based ranking</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.07071.13">10.4230/DagSemProc.07071.13</a>
</li>
<li>
    <span class="authors">Sudipto Guha and Boulos Harb</span>
    <span class="title">Nonlinear Approximation and Image Representation using Wavelets</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.07071.14">10.4230/DagSemProc.07071.14</a>
</li>
<li>
    <span class="authors">Sebastiano Vigna</span>
    <span class="title">Stanford Matrix Considered Harmful</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.07071.15">10.4230/DagSemProc.07071.15</a>
</li>
<li>
    <span class="authors">Philip A. Knight</span>
    <span class="title">The Sinkhorn-Knopp Algorithm:Convergence and Applications</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.07071.16">10.4230/DagSemProc.07071.16</a>
</li>
<li>
    <span class="authors">David Gleich, Peter Glynn, Gene Golub, and Chen Greif</span>
    <span class="title">Three results on the PageRank vector:  eigenstructure, sensitivity, and the derivative</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.07071.17">10.4230/DagSemProc.07071.17</a>
</li>
</ul>

The metadata provided by Dagstuhl Publishing on its webpages, as well as their export formats (such as XML or BibTeX) available at our website, is released under the CC0 1.0 Public Domain Dedication license. That is, you are free to copy, distribute, use, modify, transform, build upon, and produce derived works from our data, even for commercial purposes, all without asking permission. Of course, we are always happy if you provide a link to us as the source of the data.

Read the full CC0 1.0 legal code for the exact terms that apply: https://creativecommons.org/publicdomain/zero/1.0/legalcode