Andreas Frommer, Michael W. Mahoney, and Daniel B. Szyld. 07071 Abstracts Collection – Web Information Retrieval and Linear Algebra Algorithms. In Web Information Retrieval and Linear Algebra Algorithms. Dagstuhl Seminar Proceedings, Volume 7071, pp. 1-20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2007)
@InProceedings{frommer_et_al:DagSemProc.07071.1, author = {Frommer, Andreas and Mahoney, Michael W. and Szyld, Daniel B.}, title = {{07071 Abstracts Collection – Web Information Retrieval and Linear Algebra Algorithms}}, booktitle = {Web Information Retrieval and Linear Algebra Algorithms}, pages = {1--20}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2007}, volume = {7071}, editor = {Andreas Frommer and Michael W. Mahoney and Daniel B. Szyld}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.07071.1}, URN = {urn:nbn:de:0030-drops-10743}, doi = {10.4230/DagSemProc.07071.1}, annote = {Keywords: Information retrieval, Markov chains, PageRank, numerical linear algebra, low rank approximations, sparsity, ranking} }
Andreas Frommer, Michael W. Mahoney, and Daniel B. Szyld. 07071 Report on Dagstuhl Seminar – Web Information Retrieval and Linear Algebra Algorithms. In Web Information Retrieval and Linear Algebra Algorithms. Dagstuhl Seminar Proceedings, Volume 7071, pp. 1-3, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2007)
@InProceedings{frommer_et_al:DagSemProc.07071.2, author = {Frommer, Andreas and Mahoney, Michael W. and Szyld, Daniel B.}, title = {{07071 Report on Dagstuhl Seminar – Web Information Retrieval and Linear Algebra Algorithms}}, booktitle = {Web Information Retrieval and Linear Algebra Algorithms}, pages = {1--3}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2007}, volume = {7071}, editor = {Andreas Frommer and Michael W. Mahoney and Daniel B. Szyld}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.07071.2}, URN = {urn:nbn:de:0030-drops-10709}, doi = {10.4230/DagSemProc.07071.2}, annote = {Keywords: Information retrieval, Markov chains, PageRank, numerical linear algebra, low rank approximations, sparsity , ranking} }
Paolo Boldi, Massimo Santini, and Sebastiano Vigna. A Deeper Investigation of PageRank as a Function of the Damping Factor. In Web Information Retrieval and Linear Algebra Algorithms. Dagstuhl Seminar Proceedings, Volume 7071, pp. 1-19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2007)
@InProceedings{boldi_et_al:DagSemProc.07071.3, author = {Boldi, Paolo and Santini, Massimo and Vigna, Sebastiano}, title = {{A Deeper Investigation of PageRank as a Function of the Damping Factor}}, booktitle = {Web Information Retrieval and Linear Algebra Algorithms}, pages = {1--19}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2007}, volume = {7071}, editor = {Andreas Frommer and Michael W. Mahoney and Daniel B. Szyld}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.07071.3}, URN = {urn:nbn:de:0030-drops-10722}, doi = {10.4230/DagSemProc.07071.3}, annote = {Keywords: PageRank, damping factor, Markov chains} }
Philip A. Knight and Daniel Ruiz. A Fast Algorithm for Matrix Balancing. In Web Information Retrieval and Linear Algebra Algorithms. Dagstuhl Seminar Proceedings, Volume 7071, pp. 1-18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2007)
@InProceedings{knight_et_al:DagSemProc.07071.4, author = {Knight, Philip A. and Ruiz, Daniel}, title = {{A Fast Algorithm for Matrix Balancing}}, booktitle = {Web Information Retrieval and Linear Algebra Algorithms}, pages = {1--18}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2007}, volume = {7071}, editor = {Andreas Frommer and Michael W. Mahoney and Daniel B. Szyld}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.07071.4}, URN = {urn:nbn:de:0030-drops-10735}, doi = {10.4230/DagSemProc.07071.4}, annote = {Keywords: Matrix balancing, Sinkhorn-Knopp algorithm, doubly stochastic matrix, conjugate gradient iteration} }
Andrew P. Gray, Chen Greif, and Tracy Lau. An Inner/Outer Stationary Iteration for Computing PageRank. In Web Information Retrieval and Linear Algebra Algorithms. Dagstuhl Seminar Proceedings, Volume 7071, pp. 1-8, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2007)
@InProceedings{gray_et_al:DagSemProc.07071.5, author = {Gray, Andrew P. and Greif, Chen and Lau, Tracy}, title = {{An Inner/Outer Stationary Iteration for Computing PageRank}}, booktitle = {Web Information Retrieval and Linear Algebra Algorithms}, pages = {1--8}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2007}, volume = {7071}, editor = {Andreas Frommer and Michael W. Mahoney and Daniel B. Szyld}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.07071.5}, URN = {urn:nbn:de:0030-drops-10628}, doi = {10.4230/DagSemProc.07071.5}, annote = {Keywords: PageRank, power method, stationary method, inner/outer iterations, damping factor} }
Giorgios Kollias and Efstratios Gallopoulos. Asynchronous Computation of PageRank computation in an interactive multithreading environment. In Web Information Retrieval and Linear Algebra Algorithms. Dagstuhl Seminar Proceedings, Volume 7071, pp. 1-13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2007)
@InProceedings{kollias_et_al:DagSemProc.07071.6, author = {Kollias, Giorgios and Gallopoulos, Efstratios}, title = {{Asynchronous Computation of PageRank computation in an interactive multithreading environment}}, booktitle = {Web Information Retrieval and Linear Algebra Algorithms}, pages = {1--13}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2007}, volume = {7071}, editor = {Andreas Frommer and Michael W. Mahoney and Daniel B. Szyld}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.07071.6}, URN = {urn:nbn:de:0030-drops-10651}, doi = {10.4230/DagSemProc.07071.6}, annote = {Keywords: Asynchronous, pagerank, multithreading, multiprocessing} }
Ivo Marek, Ivana Pultarová, and Petr Mayer. Convergence of iterative aggregation/disaggregation methods based on splittings with cyclic iteration matrices. In Web Information Retrieval and Linear Algebra Algorithms. Dagstuhl Seminar Proceedings, Volume 7071, pp. 1-27, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2007)
@InProceedings{marek_et_al:DagSemProc.07071.7, author = {Marek, Ivo and Pultarov\'{a}, Ivana and Mayer, Petr}, title = {{Convergence of iterative aggregation/disaggregation methods based on splittings with cyclic iteration matrices}}, booktitle = {Web Information Retrieval and Linear Algebra Algorithms}, pages = {1--27}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2007}, volume = {7071}, editor = {Andreas Frommer and Michael W. Mahoney and Daniel B. Szyld}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.07071.7}, URN = {urn:nbn:de:0030-drops-10679}, doi = {10.4230/DagSemProc.07071.7}, annote = {Keywords: Iterative aggregation methods, stochastic matrix, stationary probability vector, Markov chains, cyclic iteration matrix, Google matrix, PageRank.} }
Julia Luxenburger and Gerhard Weikum. Exploiting Community Behavior for Enhanced Link Analysis and Web Search. In Web Information Retrieval and Linear Algebra Algorithms. Dagstuhl Seminar Proceedings, Volume 7071, pp. 1-17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2007)
@InProceedings{luxenburger_et_al:DagSemProc.07071.8, author = {Luxenburger, Julia and Weikum, Gerhard}, title = {{Exploiting Community Behavior for Enhanced Link Analysis and Web Search}}, booktitle = {Web Information Retrieval and Linear Algebra Algorithms}, pages = {1--17}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2007}, volume = {7071}, editor = {Andreas Frommer and Michael W. Mahoney and Daniel B. Szyld}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.07071.8}, URN = {urn:nbn:de:0030-drops-10660}, doi = {10.4230/DagSemProc.07071.8}, annote = {Keywords: Query logs, link analysis, Markov reward model} }
Claude Brezinski and Michela Redivo-Zaglia. Extrapolation and minimization procedures for the PageRank vector. In Web Information Retrieval and Linear Algebra Algorithms. Dagstuhl Seminar Proceedings, Volume 7071, pp. 1-6, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2007)
@InProceedings{brezinski_et_al:DagSemProc.07071.9, author = {Brezinski, Claude and Redivo-Zaglia, Michela}, title = {{Extrapolation and minimization procedures for the PageRank vector}}, booktitle = {Web Information Retrieval and Linear Algebra Algorithms}, pages = {1--6}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2007}, volume = {7071}, editor = {Andreas Frommer and Michael W. Mahoney and Daniel B. Szyld}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.07071.9}, URN = {urn:nbn:de:0030-drops-10682}, doi = {10.4230/DagSemProc.07071.9}, annote = {Keywords: Extrapolation, PageRank, Web matrix, eigenvector computation.} }
Stefano Serra Capizzano. Google Pageranking Problem: The Model and the Analysis. In Web Information Retrieval and Linear Algebra Algorithms. Dagstuhl Seminar Proceedings, Volume 7071, pp. 1-34, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2007)
@InProceedings{serracapizzano:DagSemProc.07071.10, author = {Serra Capizzano, Stefano}, title = {{Google Pageranking Problem: The Model and the Analysis}}, booktitle = {Web Information Retrieval and Linear Algebra Algorithms}, pages = {1--34}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2007}, volume = {7071}, editor = {Andreas Frommer and Michael W. Mahoney and Daniel B. Szyld}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.07071.10}, URN = {urn:nbn:de:0030-drops-10693}, doi = {10.4230/DagSemProc.07071.10}, annote = {Keywords: Google matrix, rank-one perturbation, Jordan canonical form, extrapolation formulae.} }
Catherine Fraikin and Paul Van Dooren. Graph matching with type constraints on nodes and edges. In Web Information Retrieval and Linear Algebra Algorithms. Dagstuhl Seminar Proceedings, Volume 7071, pp. 1-16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2007)
@InProceedings{fraikin_et_al:DagSemProc.07071.11, author = {Fraikin, Catherine and Van Dooren, Paul}, title = {{Graph matching with type constraints on nodes and edges}}, booktitle = {Web Information Retrieval and Linear Algebra Algorithms}, pages = {1--16}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2007}, volume = {7071}, editor = {Andreas Frommer and Michael W. Mahoney and Daniel B. Szyld}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.07071.11}, URN = {urn:nbn:de:0030-drops-10716}, doi = {10.4230/DagSemProc.07071.11}, annote = {Keywords: Graph matching, Optimization, Typed nodes, Typed edges} }
Peter Buchholz. Iteration at Different Levels: Multi-Level Methods fro Structured Markov Chains. In Web Information Retrieval and Linear Algebra Algorithms. Dagstuhl Seminar Proceedings, Volume 7071, pp. 1-10, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2007)
@InProceedings{buchholz:DagSemProc.07071.12, author = {Buchholz, Peter}, title = {{Iteration at Different Levels: Multi-Level Methods fro Structured Markov Chains}}, booktitle = {Web Information Retrieval and Linear Algebra Algorithms}, pages = {1--10}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2007}, volume = {7071}, editor = {Andreas Frommer and Michael W. Mahoney and Daniel B. Szyld}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.07071.12}, URN = {urn:nbn:de:0030-drops-10590}, doi = {10.4230/DagSemProc.07071.12}, annote = {Keywords: Stationary Analysis, Multi-Level Techniques, Kronecker Representation} }
Giorgios Kollias and Efstratios Gallopoulos. Multidamping simulation framework for link-based ranking. In Web Information Retrieval and Linear Algebra Algorithms. Dagstuhl Seminar Proceedings, Volume 7071, pp. 1-17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2007)
@InProceedings{kollias_et_al:DagSemProc.07071.13, author = {Kollias, Giorgios and Gallopoulos, Efstratios}, title = {{Multidamping simulation framework for link-based ranking}}, booktitle = {Web Information Retrieval and Linear Algebra Algorithms}, pages = {1--17}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2007}, volume = {7071}, editor = {Andreas Frommer and Michael W. Mahoney and Daniel B. Szyld}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.07071.13}, URN = {urn:nbn:de:0030-drops-10606}, doi = {10.4230/DagSemProc.07071.13}, annote = {Keywords: PageRank, Google, power method, eigenvalues, teleportation, list-based ranking, TotalRank} }
Sudipto Guha and Boulos Harb. Nonlinear Approximation and Image Representation using Wavelets. In Web Information Retrieval and Linear Algebra Algorithms. Dagstuhl Seminar Proceedings, Volume 7071, pp. 1-18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2007)
@InProceedings{guha_et_al:DagSemProc.07071.14, author = {Guha, Sudipto and Harb, Boulos}, title = {{Nonlinear Approximation and Image Representation using Wavelets}}, booktitle = {Web Information Retrieval and Linear Algebra Algorithms}, pages = {1--18}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2007}, volume = {7071}, editor = {Andreas Frommer and Michael W. Mahoney and Daniel B. Szyld}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.07071.14}, URN = {urn:nbn:de:0030-drops-10634}, doi = {10.4230/DagSemProc.07071.14}, annote = {Keywords: Nonlinear approximation, wavelets, approximation algorithms, streaming algorithms} }
Sebastiano Vigna. Stanford Matrix Considered Harmful. In Web Information Retrieval and Linear Algebra Algorithms. Dagstuhl Seminar Proceedings, Volume 7071, pp. 1-3, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2007)
@InProceedings{vigna:DagSemProc.07071.15, author = {Vigna, Sebastiano}, title = {{Stanford Matrix Considered Harmful}}, booktitle = {Web Information Retrieval and Linear Algebra Algorithms}, pages = {1--3}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2007}, volume = {7071}, editor = {Andreas Frommer and Michael W. Mahoney and Daniel B. Szyld}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.07071.15}, URN = {urn:nbn:de:0030-drops-10587}, doi = {10.4230/DagSemProc.07071.15}, annote = {Keywords: Weg graph, PageRank, HITS} }
Philip A. Knight. The Sinkhorn-Knopp Algorithm:Convergence and Applications. In Web Information Retrieval and Linear Algebra Algorithms. Dagstuhl Seminar Proceedings, Volume 7071, pp. 1-18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2007)
@InProceedings{knight:DagSemProc.07071.16, author = {Knight, Philip A.}, title = {{The Sinkhorn-Knopp Algorithm:Convergence and Applications}}, booktitle = {Web Information Retrieval and Linear Algebra Algorithms}, pages = {1--18}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2007}, volume = {7071}, editor = {Andreas Frommer and Michael W. Mahoney and Daniel B. Szyld}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.07071.16}, URN = {urn:nbn:de:0030-drops-10644}, doi = {10.4230/DagSemProc.07071.16}, annote = {Keywords: Matrix balancing, Sinkhorn-Knopp algorithm, PageRank, doubly stochastic matrix} }
David Gleich, Peter Glynn, Gene Golub, and Chen Greif. Three results on the PageRank vector: eigenstructure, sensitivity, and the derivative. In Web Information Retrieval and Linear Algebra Algorithms. Dagstuhl Seminar Proceedings, Volume 7071, pp. 1-10, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2007)
@InProceedings{gleich_et_al:DagSemProc.07071.17, author = {Gleich, David and Glynn, Peter and Golub, Gene and Greif, Chen}, title = {{Three results on the PageRank vector: eigenstructure, sensitivity, and the derivative}}, booktitle = {Web Information Retrieval and Linear Algebra Algorithms}, pages = {1--10}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2007}, volume = {7071}, editor = {Andreas Frommer and Michael W. Mahoney and Daniel B. Szyld}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.07071.17}, URN = {urn:nbn:de:0030-drops-10615}, doi = {10.4230/DagSemProc.07071.17}, annote = {Keywords: PageRank, PageRank derivative, PageRank sensitivity, PageRank eigenstructure} }
Feedback for Dagstuhl Publishing