Search Results

Documents authored by Szyld, Daniel B.

Document
DOI: 10.4230/DagSemProc.07071.1
07071 Abstracts Collection – Web Information Retrieval and Linear Algebra Algorithms

Authors: Andreas Frommer, Michael W. Mahoney, and Daniel B. Szyld

Published in: Dagstuhl Seminar Proceedings, Volume 7071, Web Information Retrieval and Linear Algebra Algorithms (2007)

Abstract
From 12th to 16th February 2007, the Dagstuhl Seminar 07071 ``Web Information Retrieval and Linear Algebra Algorithms'' was held in the International Conference and Research Center (IBFI), Schloss Dagstuhl. During the seminar, several participants presented their current research, and ongoing work and open problems were discussed. Abstracts of the presentations given during the seminar as well as abstracts of seminar results and ideas are put together in this paper. The first section describes the seminar topics and goals in general. Links to extended abstracts or full papers are provided, if available.
Cite as

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)

Copy BibTex To Clipboard

@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.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}
}
Document
DOI: 10.4230/DagSemProc.07071.2
07071 Report on Dagstuhl Seminar – Web Information Retrieval and Linear Algebra Algorithms

Authors: Andreas Frommer, Michael W. Mahoney, and Daniel B. Szyld

Published in: Dagstuhl Seminar Proceedings, Volume 7071, Web Information Retrieval and Linear Algebra Algorithms (2007)

Abstract
A seminar concentrating on the intersection of the fields of information retrieval and other web-related aspects with numerical and applied linear algebra techniques was held with the attendance of scientists from industry and academia.
Cite as

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)

Copy BibTex To Clipboard

@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.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}
}
Document
DOI: 10.4230/DagSemRep.398
Theoretical and Computational Aspects of Matrix Algorithms (Dagstuhl Seminar 03421)

Authors: Nick Higham, Volker Mehrmann, Siegfried M. Rump, and Daniel B. Szyld

Published in: Dagstuhl Seminar Reports. Dagstuhl Seminar Reports, Volume 1 (2021)

Abstract
Cite as

Nick Higham, Volker Mehrmann, Siegfried M. Rump, and Daniel B. Szyld. Theoretical and Computational Aspects of Matrix Algorithms (Dagstuhl Seminar 03421). Dagstuhl Seminar Report 398, pp. 1-5, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2003)

Copy BibTex To Clipboard

@TechReport{higham_et_al:DagSemRep.398,
  author =	{Higham, Nick and Mehrmann, Volker and Rump, Siegfried M. and Szyld, Daniel B.},
  title =	{{Theoretical and Computational Aspects of Matrix Algorithms (Dagstuhl Seminar 03421)}},
  pages =	{1--5},
  ISSN =	{1619-0203},
  year =	{2003},
  type = 	{Dagstuhl Seminar Report},
  number =	{398},
  institution =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemRep.398},
  URN =		{urn:nbn:de:0030-drops-152786},
  doi =		{10.4230/DagSemRep.398},
}
Any Issues?
X

Feedback on the Current Page

CAPTCHA

Thanks for your feedback!

Feedback submitted to Dagstuhl Publishing

Could not send message

Please try again later or send an E-mail
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact