9 Search Results for "Seidel, Hans-Peter"

Document
DOI: 10.4230/LIPIcs.MFCS.2019.25
Random Subgroups of Rationals

Authors: Ziyuan Gao, Sanjay Jain, Bakhadyr Khoussainov, Wei Li, Alexander Melnikov, Karen Seidel, and Frank Stephan

Published in: LIPIcs, Volume 138, 44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019)

Abstract
This paper introduces and studies a notion of algorithmic randomness for subgroups of rationals. Given a randomly generated additive subgroup (G,+) of rationals, two main questions are addressed: first, what are the model-theoretic and recursion-theoretic properties of (G,+); second, what learnability properties can one extract from G and its subclass of finitely generated subgroups? For the first question, it is shown that the theory of (G,+) coincides with that of the additive group of integers and is therefore decidable; furthermore, while the word problem for G with respect to any generating sequence for G is not even semi-decidable, one can build a generating sequence beta such that the word problem for G with respect to beta is co-recursively enumerable (assuming that the set of generators of G is limit-recursive). In regard to the second question, it is proven that there is a generating sequence beta for G such that every non-trivial finitely generated subgroup of G is recursively enumerable and the class of all such subgroups of G is behaviourally correctly learnable, that is, every non-trivial finitely generated subgroup can be semantically identified in the limit (again assuming that the set of generators of G is limit-recursive). On the other hand, the class of non-trivial finitely generated subgroups of G cannot be syntactically identified in the limit with respect to any generating sequence for G. The present work thus contributes to a recent line of research studying algorithmically random infinite structures and uncovers an interesting connection between the arithmetical complexity of the set of generators of a randomly generated subgroup of rationals and the learnability of its finitely generated subgroups.
Cite as

Ziyuan Gao, Sanjay Jain, Bakhadyr Khoussainov, Wei Li, Alexander Melnikov, Karen Seidel, and Frank Stephan. Random Subgroups of Rationals. In 44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 138, pp. 25:1-25:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)

Copy BibTex To Clipboard

@InProceedings{gao_et_al:LIPIcs.MFCS.2019.25,
  author =	{Gao, Ziyuan and Jain, Sanjay and Khoussainov, Bakhadyr and Li, Wei and Melnikov, Alexander and Seidel, Karen and Stephan, Frank},
  title =	{{Random Subgroups of Rationals}},
  booktitle =	{44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019)},
  pages =	{25:1--25:14},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-117-7},
  ISSN =	{1868-8969},
  year =	{2019},
  volume =	{138},
  editor =	{Rossmanith, Peter and Heggernes, Pinar and Katoen, Joost-Pieter},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2019.25},
  URN =		{urn:nbn:de:0030-drops-109693},
  doi =		{10.4230/LIPIcs.MFCS.2019.25},
  annote =	{Keywords: Martin-L\"{o}f randomness, subgroups of rationals, finitely generated subgroups of rationals, learning in the limit, behaviourally correct learning}
}
Document
DOI: 10.4230/LIPIcs.STACS.2019.58
A Unified Approach to Tail Estimates for Randomized Incremental Construction

Authors: Sandeep Sen

Published in: LIPIcs, Volume 126, 36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019)

Abstract
By combining several interesting applications of random sampling in geometric algorithms like point location, linear programming, segment intersections, binary space partitioning, Clarkson and Shor [Kenneth L. Clarkson and Peter W. Shor, 1989] developed a general framework of randomized incremental construction (RIC ). The basic idea is to add objects in a random order and show that this approach yields efficient/optimal bounds on expected running time. Even quicksort can be viewed as a special case of this paradigm. However, unlike quicksort, for most of these problems, sharper tail estimates on their running times are not known. Barring some promising attempts in [Kurt Mehlhorn et al., 1993; Kenneth L. Clarkson et al., 1992; Raimund Seidel, 1991], the general question remains unresolved. In this paper we present a general technique to obtain tail estimates for RIC and and provide applications to some fundamental problems like Delaunay triangulations and construction of Visibility maps of intersecting line segments. The main result of the paper is derived from a new and careful application of Freedman’s [David Freedman, 1975] inequality for Martingale concentration that overcomes the bottleneck of the better known Azuma-Hoeffding inequality. Further, we explore instances, where an RIC based algorithm may not have inverse polynomial tail estimates. In particular, we show that the RIC time bounds for trapezoidal map can encounter a running time of Omega (n log n log log n) with probability exceeding 1/(sqrt{n)}. This rules out inverse polynomial concentration bounds within a constant factor of the O(n log n) expected running time.
Cite as

Sandeep Sen. A Unified Approach to Tail Estimates for Randomized Incremental Construction. In 36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 126, pp. 58:1-58:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)

Copy BibTex To Clipboard

@InProceedings{sen:LIPIcs.STACS.2019.58,
  author =	{Sen, Sandeep},
  title =	{{A Unified Approach to Tail Estimates for Randomized Incremental Construction}},
  booktitle =	{36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019)},
  pages =	{58:1--58:16},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-100-9},
  ISSN =	{1868-8969},
  year =	{2019},
  volume =	{126},
  editor =	{Niedermeier, Rolf and Paul, Christophe},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2019.58},
  URN =		{urn:nbn:de:0030-drops-102977},
  doi =		{10.4230/LIPIcs.STACS.2019.58},
  annote =	{Keywords: ric, tail estimates, martingale, lower bound}
}
Document
DOI: 10.4230/OASIcs.SOSA.2018.9
Simple and Efficient Leader Election

Authors: Petra Berenbrink, Dominik Kaaser, Peter Kling, and Lena Otterbach

Published in: OASIcs, Volume 61, 1st Symposium on Simplicity in Algorithms (SOSA 2018)

Abstract
We provide a simple and efficient population protocol for leader election that uses O(log n) states and elects exactly one leader in O(n (log n)^2) interactions with high probability and in expectation. Our analysis is simple and based on fundamental stochastic arguments. Our protocol combines the tournament based leader elimination by Alistarh and Gelashvili, ICALP'15, with the synthetic coin introduced by Alistarh et al., SODA'17.
Cite as

Petra Berenbrink, Dominik Kaaser, Peter Kling, and Lena Otterbach. Simple and Efficient Leader Election. In 1st Symposium on Simplicity in Algorithms (SOSA 2018). Open Access Series in Informatics (OASIcs), Volume 61, pp. 9:1-9:11, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)

Copy BibTex To Clipboard

@InProceedings{berenbrink_et_al:OASIcs.SOSA.2018.9,
  author =	{Berenbrink, Petra and Kaaser, Dominik and Kling, Peter and Otterbach, Lena},
  title =	{{Simple and Efficient Leader Election}},
  booktitle =	{1st Symposium on Simplicity in Algorithms (SOSA 2018)},
  pages =	{9:1--9:11},
  series =	{Open Access Series in Informatics (OASIcs)},
  ISBN =	{978-3-95977-064-4},
  ISSN =	{2190-6807},
  year =	{2018},
  volume =	{61},
  editor =	{Seidel, Raimund},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.SOSA.2018.9},
  URN =		{urn:nbn:de:0030-drops-83029},
  doi =		{10.4230/OASIcs.SOSA.2018.9},
  annote =	{Keywords: population protocols, leader election, distributed, randomized}
}
Document
DOI: 10.4230/DagSemProc.07171.1
07171 Abstracts Collection – Visual Computing – Convergence of Computer Graphics and Computer Vision

Authors: Markus Gross, Heinrich Müller, Hans-Peter Seidel, and Harry Shum

Published in: Dagstuhl Seminar Proceedings, Volume 7171, Visual Computing - Convergence of Computer Graphics and Computer Vision (2008)

Abstract
From 22.04. to 27.04.2007, the Dagstuhl Seminar 07171 ``Visual Computing - Convergence of Computer Graphics and Computer Vision'' 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

Markus Gross, Heinrich Müller, Hans-Peter Seidel, and Harry Shum. 07171 Abstracts Collection – Visual Computing – Convergence of Computer Graphics and Computer Vision. In Visual Computing - Convergence of Computer Graphics and Computer Vision. Dagstuhl Seminar Proceedings, Volume 7171, pp. 1-18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2008)

Copy BibTex To Clipboard

@InProceedings{gross_et_al:DagSemProc.07171.1,
  author =	{Gross, Markus and M\"{u}ller, Heinrich and Seidel, Hans-Peter and Shum, Harry},
  title =	{{07171 Abstracts Collection – Visual Computing – Convergence of Computer Graphics and Computer Vision}},
  booktitle =	{Visual Computing - Convergence of Computer Graphics and Computer Vision},
  pages =	{1--18},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2008},
  volume =	{7171},
  editor =	{Markus Gross and Heinrich M\"{u}ller and Hans-Peter Seidel and Harry Shum},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.07171.1},
  URN =		{urn:nbn:de:0030-drops-15044},
  doi =		{10.4230/DagSemProc.07171.1},
  annote =	{Keywords: Image- and video-based modeling and rendering, perception-guided modeling and rendering, texture synthesis, scattering and reflectance measurement rendering, capturing reality (appearance, motion) from images, 3D acquisition and display, 3D reconstruction, image and model compression, computation}
}
Document
DOI: 10.4230/DagSemProc.07171.2
07171 Summary – Visual Computing – Convergence of Computer Graphics and Computer Vision

Authors: Markus Gross, Heinrich Müller, Hans-Peter Seidel, and Harry Shum

Published in: Dagstuhl Seminar Proceedings, Volume 7171, Visual Computing - Convergence of Computer Graphics and Computer Vision (2008)

Abstract
Due to the importance of visual information for humans, visual computing is at the very core of the technologies enabling the modern information society. New and emerging technologies such as multimedia, digital television, telecommunication and telepresence, or virtual reality further indicate the tremendous potential of visual interaction with computers in the years to come. Typical for the field is the coincidence of very large data sets with the demand for fast, if possible interactive, user-adapted high quality visual display of the results. Furthermore, the user should be able to interact with the environment in a natural and intuitive way. In order to address the challenges mentioned above, a new and more integrated scientific view of Visual Computing is required that unifies the previously separate ''visual'' disciplines of computer graphics and computer vision. Computer graphics is traditionally concerned with generating visual interfaces of computers and applications to the user. Computer vision focuses on enabling computers to understand and interpret visual information from static images and video sequences.
Cite as

Markus Gross, Heinrich Müller, Hans-Peter Seidel, and Harry Shum. 07171 Summary – Visual Computing – Convergence of Computer Graphics and Computer Vision. In Visual Computing - Convergence of Computer Graphics and Computer Vision. Dagstuhl Seminar Proceedings, Volume 7171, pp. 1-4, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2008)

Copy BibTex To Clipboard

@InProceedings{gross_et_al:DagSemProc.07171.2,
  author =	{Gross, Markus and M\"{u}ller, Heinrich and Seidel, Hans-Peter and Shum, Harry},
  title =	{{07171 Summary – Visual Computing – Convergence of Computer Graphics and Computer Vision}},
  booktitle =	{Visual Computing - Convergence of Computer Graphics and Computer Vision},
  pages =	{1--4},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2008},
  volume =	{7171},
  editor =	{Markus Gross and Heinrich M\"{u}ller and Hans-Peter Seidel and Harry Shum},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.07171.2},
  URN =		{urn:nbn:de:0030-drops-15032},
  doi =		{10.4230/DagSemProc.07171.2},
  annote =	{Keywords: Image- and video-based modeling and rendering, perception-guided modeling and rendering, texture synthesis, scattering and reflectance measurement rendering, capturing reality (appearance, motion) from images, 3D acquisition and display, 3D reconstruction, image and model compression, computation}
}
Document
DOI: 10.4230/DagSemProc.07171.3
Image-Based Motion Compensation for Structured Light Scanning of Dynamic Surfaces

Authors: Stefan Gumhold and Sören König

Published in: Dagstuhl Seminar Proceedings, Volume 7171, Visual Computing - Convergence of Computer Graphics and Computer Vision (2008)

Abstract
Structured light scanning systems based on temporal pattern codification produce dense and robust results on static scenes but behave very poorly when applied to dynamic scenes in which objects are allowed to move or to deform during the acquisition process. The main reason for this lies in the wrong combination of encoded correspondence information because the same point in the projector pattern sequence can map to different points within the camera images due to depth changes over time. We present a novel approach suitable for measuring and compensating such kind of pattern motion. The described technique can be combined with existing active range scanning systems designed for static surface reconstruction making them applicable for the dynamic case. We demonstrate the benefits of our method by integrating it into a gray code based structured light scanner, which runs at thirty 3d scans per second.
Cite as

Stefan Gumhold and Sören König. Image-Based Motion Compensation for Structured Light Scanning of Dynamic Surfaces. In Visual Computing - Convergence of Computer Graphics and Computer Vision. Dagstuhl Seminar Proceedings, Volume 7171, pp. 1-4, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2008)

Copy BibTex To Clipboard

@InProceedings{gumhold_et_al:DagSemProc.07171.3,
  author =	{Gumhold, Stefan and K\"{o}nig, S\"{o}ren},
  title =	{{Image-Based Motion Compensation for Structured Light Scanning of Dynamic Surfaces}},
  booktitle =	{Visual Computing - Convergence of Computer Graphics and Computer Vision},
  pages =	{1--4},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2008},
  volume =	{7171},
  editor =	{Markus Gross and Heinrich M\"{u}ller and Hans-Peter Seidel and Harry Shum},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.07171.3},
  URN =		{urn:nbn:de:0030-drops-15022},
  doi =		{10.4230/DagSemProc.07171.3},
  annote =	{Keywords: 3d scanning, motion compensation, optical flow, structured light, dynamic surfaces}
}
Document
DOI: 10.4230/DagSemRep.384
Hierarchical Methods in Computer Graphics (Dagstuhl Seminar 03271)

Authors: Markus Gross, Dinesh Manocha, Heinrich Müller, and Hans-Peter Seidel

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

Abstract
Cite as

Markus Gross, Dinesh Manocha, Heinrich Müller, and Hans-Peter Seidel. Hierarchical Methods in Computer Graphics (Dagstuhl Seminar 03271). Dagstuhl Seminar Report 384, pp. 1-6, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2003)

Copy BibTex To Clipboard

@TechReport{gross_et_al:DagSemRep.384,
  author =	{Gross, Markus and Manocha, Dinesh and M\"{u}ller, Heinrich and Seidel, Hans-Peter},
  title =	{{Hierarchical Methods in Computer Graphics (Dagstuhl Seminar 03271)}},
  pages =	{1--6},
  ISSN =	{1619-0203},
  year =	{2003},
  type = 	{Dagstuhl Seminar Report},
  number =	{384},
  institution =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemRep.384},
  URN =		{urn:nbn:de:0030-drops-152644},
  doi =		{10.4230/DagSemRep.384},
}
Document
DOI: 10.4230/DagSemRep.278
Image Synthesis and Interactive 3D Graphics (Dagstuhl Seminar 00251)

Authors: Michael Cohen, Heinrich Müller, Claude Puech, and Hans-Peter Seidel

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

Abstract
Cite as

Michael Cohen, Heinrich Müller, Claude Puech, and Hans-Peter Seidel. Image Synthesis and Interactive 3D Graphics (Dagstuhl Seminar 00251). Dagstuhl Seminar Report 278, pp. 1-34, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2001)

Copy BibTex To Clipboard

@TechReport{cohen_et_al:DagSemRep.278,
  author =	{Cohen, Michael and M\"{u}ller, Heinrich and Puech, Claude and Seidel, Hans-Peter},
  title =	{{Image Synthesis and Interactive 3D Graphics (Dagstuhl Seminar 00251)}},
  pages =	{1--34},
  ISSN =	{1619-0203},
  year =	{2001},
  type = 	{Dagstuhl Seminar Report},
  number =	{278},
  institution =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemRep.278},
  URN =		{urn:nbn:de:0030-drops-151620},
  doi =		{10.4230/DagSemRep.278},
}
Document
DOI: 10.4230/DagSemRep.212
Hierarchical Methods in Computer Graphics (Dagstuhl Seminar 98211)

Authors: Markus Gross, Heinrich Müller, Peter Schröder, and Hans-Peter Seidel

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

Abstract
Cite as

Markus Gross, Heinrich Müller, Peter Schröder, and Hans-Peter Seidel. Hierarchical Methods in Computer Graphics (Dagstuhl Seminar 98211). Dagstuhl Seminar Report 212, pp. 1-23, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (1998)

Copy BibTex To Clipboard

@TechReport{gross_et_al:DagSemRep.212,
  author =	{Gross, Markus and M\"{u}ller, Heinrich and Schr\"{o}der, Peter and Seidel, Hans-Peter},
  title =	{{Hierarchical Methods in Computer Graphics (Dagstuhl Seminar 98211)}},
  pages =	{1--23},
  ISSN =	{1619-0203},
  year =	{1998},
  type = 	{Dagstuhl Seminar Report},
  number =	{212},
  institution =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemRep.212},
  URN =		{urn:nbn:de:0030-drops-150983},
  doi =		{10.4230/DagSemRep.212},
}
  • Refine by Author
  • 5 Müller, Heinrich
  • 5 Seidel, Hans-Peter
  • 4 Gross, Markus
  • 2 Shum, Harry
  • 1 Berenbrink, Petra
  • Show More...

  • Refine by Classification
  • 1 Theory of computation → Computational geometry
  • 1 Theory of computation → Inductive inference
  • 1 Theory of computation → Pseudorandomness and derandomization

  • Refine by Keyword
  • 2 3D acquisition and display
  • 2 3D reconstruction
  • 2 Image- and video-based modeling and rendering
  • 2 capturing reality (appearance
  • 2 computation
  • Show More...

  • Refine by Type
  • 9 document

  • Refine by Publication Year
  • 3 2008
  • 2 2019
  • 1 1998
  • 1 2001
  • 1 2003
  • Show More...

Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

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