Published in: LIPIcs, Volume 229, 49th International Colloquium on Automata, Languages, and Programming (ICALP 2022)
Antonio Casares, Thomas Colcombet, and Karoliina Lehtinen. On the Size of Good-For-Games Rabin Automata and Its Link with the Memory in Muller Games. In 49th International Colloquium on Automata, Languages, and Programming (ICALP 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 229, pp. 117:1-117:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{casares_et_al:LIPIcs.ICALP.2022.117, author = {Casares, Antonio and Colcombet, Thomas and Lehtinen, Karoliina}, title = {{On the Size of Good-For-Games Rabin Automata and Its Link with the Memory in Muller Games}}, booktitle = {49th International Colloquium on Automata, Languages, and Programming (ICALP 2022)}, pages = {117:1--117:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-235-8}, ISSN = {1868-8969}, year = {2022}, volume = {229}, editor = {Boja\'{n}czyk, Miko{\l}aj and Merelli, Emanuela and Woodruff, David P.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2022.117}, URN = {urn:nbn:de:0030-drops-164580}, doi = {10.4230/LIPIcs.ICALP.2022.117}, annote = {Keywords: Infinite duration games, Muller games, Rabin conditions, omega-regular languages, memory in games, good-for-games automata} }
Published in: LIPIcs, Volume 216, 30th EACSL Annual Conference on Computer Science Logic (CSL 2022)
Antonio Casares. On the Minimisation of Transition-Based Rabin Automata and the Chromatic Memory Requirements of Muller Conditions. In 30th EACSL Annual Conference on Computer Science Logic (CSL 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 216, pp. 12:1-12:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{casares:LIPIcs.CSL.2022.12, author = {Casares, Antonio}, title = {{On the Minimisation of Transition-Based Rabin Automata and the Chromatic Memory Requirements of Muller Conditions}}, booktitle = {30th EACSL Annual Conference on Computer Science Logic (CSL 2022)}, pages = {12:1--12:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-218-1}, ISSN = {1868-8969}, year = {2022}, volume = {216}, editor = {Manea, Florin and Simpson, Alex}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2022.12}, URN = {urn:nbn:de:0030-drops-157322}, doi = {10.4230/LIPIcs.CSL.2022.12}, annote = {Keywords: Automata on Infinite Words, Games on Graphs, Arena-Independent Memory, Complexity} }
Published in: LIPIcs, Volume 198, 48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)
Antonio Casares, Thomas Colcombet, and Nathanaël Fijalkow. Optimal Transformations of Games and Automata Using Muller Conditions. In 48th International Colloquium on Automata, Languages, and Programming (ICALP 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 198, pp. 123:1-123:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{casares_et_al:LIPIcs.ICALP.2021.123, author = {Casares, Antonio and Colcombet, Thomas and Fijalkow, Nathana\"{e}l}, title = {{Optimal Transformations of Games and Automata Using Muller Conditions}}, booktitle = {48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)}, pages = {123:1--123:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-195-5}, ISSN = {1868-8969}, year = {2021}, volume = {198}, editor = {Bansal, Nikhil and Merelli, Emanuela and Worrell, James}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.123}, URN = {urn:nbn:de:0030-drops-141928}, doi = {10.4230/LIPIcs.ICALP.2021.123}, annote = {Keywords: Automata over infinite words, Omega regular languages, Determinisation of automata} }
Published in: LIPIcs, Volume 151, 11th Innovations in Theoretical Computer Science Conference (ITCS 2020)
Orr Paradise. Smooth and Strong PCPs. In 11th Innovations in Theoretical Computer Science Conference (ITCS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 151, pp. 2:1-2:41, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{paradise:LIPIcs.ITCS.2020.2, author = {Paradise, Orr}, title = {{Smooth and Strong PCPs}}, booktitle = {11th Innovations in Theoretical Computer Science Conference (ITCS 2020)}, pages = {2:1--2:41}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-134-4}, ISSN = {1868-8969}, year = {2020}, volume = {151}, editor = {Vidick, Thomas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2020.2}, URN = {urn:nbn:de:0030-drops-116875}, doi = {10.4230/LIPIcs.ITCS.2020.2}, annote = {Keywords: Interactive and probabilistic proof systems, Probabilistically checkable proofs, Hardness of approximation} }
Published in: LIPIcs, Volume 32, 1st Summit on Advances in Programming Languages (SNAPL 2015)
Umut A. Acar, Guy Blelloch, Matthew Fluet, Stefan K. Muller, and Ram Raghunathan. Coupling Memory and Computation for Locality Management. In 1st Summit on Advances in Programming Languages (SNAPL 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 32, pp. 1-14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{acar_et_al:LIPIcs.SNAPL.2015.1, author = {Acar, Umut A. and Blelloch, Guy and Fluet, Matthew and Muller, Stefan K. and Raghunathan, Ram}, title = {{Coupling Memory and Computation for Locality Management}}, booktitle = {1st Summit on Advances in Programming Languages (SNAPL 2015)}, pages = {1--14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-80-4}, ISSN = {1868-8969}, year = {2015}, volume = {32}, editor = {Ball, Thomas and Bodík, Rastislav and Krishnamurthi, Shriram and Lerner, Benjamin S. and Morriset, Greg}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SNAPL.2015.1}, URN = {urn:nbn:de:0030-drops-50121}, doi = {10.4230/LIPIcs.SNAPL.2015.1}, annote = {Keywords: Parallel computing, locality, memory management, parallel garbage collection, functional programming, nested parallelism, thread scheduling} }
Published in: Dagstuhl Follow-Ups, Volume 3, Multimodal Music Processing (2012)
Verena Thomas, Christian Fremerey, Meinard Müller, and Michael Clausen. Linking Sheet Music and Audio - Challenges and New Approaches. In Multimodal Music Processing. Dagstuhl Follow-Ups, Volume 3, pp. 1-22, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)
@InCollection{thomas_et_al:DFU.Vol3.11041.1, author = {Thomas, Verena and Fremerey, Christian and M\"{u}ller, Meinard and Clausen, Michael}, title = {{Linking Sheet Music and Audio - Challenges and New Approaches}}, booktitle = {Multimodal Music Processing}, pages = {1--22}, series = {Dagstuhl Follow-Ups}, ISBN = {978-3-939897-37-8}, ISSN = {1868-8977}, year = {2012}, volume = {3}, editor = {M\"{u}ller, Meinard and Goto, Masataka and Schedl, Markus}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DFU.Vol3.11041.1}, URN = {urn:nbn:de:0030-drops-34637}, doi = {10.4230/DFU.Vol3.11041.1}, annote = {Keywords: Music signals, audio, sheet music, music synchronization, alignment, optical music recognition, user interfaces, multimodality} }
Published in: Dagstuhl Seminar Proceedings, Volume 10431, Software Engineering for Self-Adaptive Systems (2011)
Rogerio de Lemos, Holger Giese, Hausi Müller, Mary Shaw, Jesper Andersson, Luciano Baresi, Basil Becker, Nelly Bencomo, Yuriy Brun, Bojan Cikic, Ron Desmarais, Schahram Dustdar, Gregor Engels, Kurt Geihs, Karl M. Goeschka, Alessandra Gorla, Vincenzo Grassi, Poala Inverardi, Gabor Karsai, Jeff Kramer, Marin Litoiu, Antonia Lopes, Jeff Magee, Sam Malek, Serge Mankovskii, Raffaela Mirandola, John Mylopoulos, Oscar Nierstrasz, Mauro Pezzè, Christian Prehofer, Wilhelm Schäfer, Wilhelm Schlichting, Bradley Schmerl, Dennis B. Smith, Joao P. Sousa, Gabriel Tamura, Ladan Tahvildari, Norha M. Villegas, Thomas Vogel, Danny Weyns, Kenny Wong, and Jochen Wuttke. Software Engineering for Self-Adaptive Systems: A second Research Roadmap. In Software Engineering for Self-Adaptive Systems. Dagstuhl Seminar Proceedings, Volume 10431, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
@InProceedings{delemos_et_al:DagSemProc.10431.3, author = {de Lemos, Rogerio and Giese, Holger and M\"{u}ller, Hausi and Shaw, Mary and Andersson, Jesper and Baresi, Luciano and Becker, Basil and Bencomo, Nelly and Brun, Yuriy and Cikic, Bojan and Desmarais, Ron and Dustdar, Schahram and Engels, Gregor and Geihs, Kurt and Goeschka, Karl M. and Gorla, Alessandra and Grassi, Vincenzo and Inverardi, Poala and Karsai, Gabor and Kramer, Jeff and Litoiu, Marin and Lopes, Antonia and Magee, Jeff and Malek, Sam and Mankovskii, Serge and Mirandola, Raffaela and Mylopoulos, John and Nierstrasz, Oscar and Pezz\`{e}, Mauro and Prehofer, Christian and Sch\"{a}fer, Wilhelm and Schlichting, Wilhelm and Schmerl, Bradley and Smith, Dennis B. and Sousa, Joao P. and Tamura, Gabriel and Tahvildari, Ladan and Villegas, Norha M. and Vogel, Thomas and Weyns, Danny and Wong, Kenny and Wuttke, Jochen}, title = {{Software Engineering for Self-Adaptive Systems: A second Research Roadmap}}, booktitle = {Software Engineering for Self-Adaptive Systems}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2011}, volume = {10431}, editor = {Rogerio de Lemos and Holger Giese and Hausi M\"{u}ller and Mary Shaw}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.10431.3}, URN = {urn:nbn:de:0030-drops-31561}, doi = {10.4230/DagSemProc.10431.3}, annote = {Keywords: } }
Published in: Dagstuhl Seminar Proceedings, Volume 10061, Circuits, Logic, and Games (2010)
Olaf Beyersdorff, Arne Meier, Sebastian Müller, Michael Thomas, and Heribert Vollmer. Proof Complexity of Propositional Default Logic. In Circuits, Logic, and Games. Dagstuhl Seminar Proceedings, Volume 10061, pp. 1-14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2010)
@InProceedings{beyersdorff_et_al:DagSemProc.10061.5, author = {Beyersdorff, Olaf and Meier, Arne and M\"{u}ller, Sebastian and Thomas, Michael and Vollmer, Heribert}, title = {{Proof Complexity of Propositional Default Logic}}, booktitle = {Circuits, Logic, and Games}, pages = {1--14}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2010}, volume = {10061}, editor = {Benjamin Rossman and Thomas Schwentick and Denis Th\'{e}rien and Heribert Vollmer}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.10061.5}, URN = {urn:nbn:de:0030-drops-25261}, doi = {10.4230/DagSemProc.10061.5}, annote = {Keywords: Proof complexity, default logic, sequent calculus} }
Published in: Dagstuhl Seminar Proceedings, Volume 9391, Algorithms and Complexity for Continuous Problems (2009)
Thomas Müller-Gronbach, Leszek Plaskota, and Joseph F. Traub. 09391 Abstracts Collection – Algorithms and Complexity for Continuous Problems. In Algorithms and Complexity for Continuous Problems. Dagstuhl Seminar Proceedings, Volume 9391, pp. 1-23, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
@InProceedings{mullergronbach_et_al:DagSemProc.09391.1, author = {M\"{u}ller-Gronbach, Thomas and Plaskota, Leszek and Traub, Joseph F.}, title = {{09391 Abstracts Collection – Algorithms and Complexity for Continuous Problems}}, booktitle = {Algorithms and Complexity for Continuous Problems}, pages = {1--23}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2009}, volume = {9391}, editor = {Thomas M\"{u}ller-Gronbach and Leszek Plaskota and Joseph. F. Traub}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.09391.1}, URN = {urn:nbn:de:0030-drops-23005}, doi = {10.4230/DagSemProc.09391.1}, annote = {Keywords: Computational complexity of continuous problems, partial information, high-dimensional problems, tractability analysis, quasi-Monte Carlo methods, op operator equations, non-linear approximation, stochastic computation, ill posed-problems} }
Published in: Dagstuhl Seminar Proceedings, Volume 9391, Algorithms and Complexity for Continuous Problems (2009)
Michael Gnewuch. Discrepancy Bounds for Mixed Sequences. In Algorithms and Complexity for Continuous Problems. Dagstuhl Seminar Proceedings, Volume 9391, pp. 1-4, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
@InProceedings{gnewuch:DagSemProc.09391.2, author = {Gnewuch, Michael}, title = {{Discrepancy Bounds for Mixed Sequences}}, booktitle = {Algorithms and Complexity for Continuous Problems}, pages = {1--4}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2009}, volume = {9391}, editor = {Thomas M\"{u}ller-Gronbach and Leszek Plaskota and Joseph. F. Traub}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.09391.2}, URN = {urn:nbn:de:0030-drops-22975}, doi = {10.4230/DagSemProc.09391.2}, annote = {Keywords: Star Discrepancy, Mixed Sequence, Hybrid Method, Monte Carlo, Quasi-Monte Carlo, Probabilistic Bounds} }
Published in: Dagstuhl Seminar Proceedings, Volume 9391, Algorithms and Complexity for Continuous Problems (2009)
Fred J. Hickernell, Thomas Müller-Gronbach, Ben Niu, and Klaus Ritter. Evaluating Expectations of Functionals of Brownian Motions: a Multilevel Idea. In Algorithms and Complexity for Continuous Problems. Dagstuhl Seminar Proceedings, Volume 9391, pp. 1-19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
@InProceedings{hickernell_et_al:DagSemProc.09391.3, author = {Hickernell, Fred J. and M\"{u}ller-Gronbach, Thomas and Niu, Ben and Ritter, Klaus}, title = {{Evaluating Expectations of Functionals of Brownian Motions: a Multilevel Idea}}, booktitle = {Algorithms and Complexity for Continuous Problems}, pages = {1--19}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2009}, volume = {9391}, editor = {Thomas M\"{u}ller-Gronbach and Leszek Plaskota and Joseph. F. Traub}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.09391.3}, URN = {urn:nbn:de:0030-drops-22987}, doi = {10.4230/DagSemProc.09391.3}, annote = {Keywords: Brownian motions, multilevel, option pricing, worst-case error} }
Published in: Dagstuhl Seminar Proceedings, Volume 9391, Algorithms and Complexity for Continuous Problems (2009)
Krzysztof Sikorski, Bhagirath Addepalli, E. R. Pardyjak, and M. Zhdanov. Quasi-Monte Carlo, Monte Carlo, and regularized gradient optimization methods for source characterization of atmospheric releases. In Algorithms and Complexity for Continuous Problems. Dagstuhl Seminar Proceedings, Volume 9391, pp. 1-19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
@InProceedings{sikorski_et_al:DagSemProc.09391.4, author = {Sikorski, Krzysztof and Addepalli, Bhagirath and Pardyjak, E. R. and Zhdanov, M.}, title = {{Quasi-Monte Carlo, Monte Carlo, and regularized gradient optimization methods for source characterization of atmospheric releases }}, booktitle = {Algorithms and Complexity for Continuous Problems}, pages = {1--19}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2009}, volume = {9391}, editor = {Thomas M\"{u}ller-Gronbach and Leszek Plaskota and Joseph. F. Traub}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.09391.4}, URN = {urn:nbn:de:0030-drops-22998}, doi = {10.4230/DagSemProc.09391.4}, annote = {Keywords: Atmospheric source problem, Gaussian Plume Model, Quasi Monte Carlo method, gradient optimization} }
Published in: Dagstuhl Seminar Proceedings, Volume 9391, Algorithms and Complexity for Continuous Problems (2009)
Michael Gnewuch. Weighted L_2 B Discrepancy and Approximation of Integrals over Reproducing Kernel Hilbert Spaces. In Algorithms and Complexity for Continuous Problems. Dagstuhl Seminar Proceedings, Volume 9391, pp. 1-9, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
@InProceedings{gnewuch:DagSemProc.09391.5, author = {Gnewuch, Michael}, title = {{Weighted L\underline2 B Discrepancy and Approximation of Integrals over Reproducing Kernel Hilbert Spaces}}, booktitle = {Algorithms and Complexity for Continuous Problems}, pages = {1--9}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2009}, volume = {9391}, editor = {Thomas M\"{u}ller-Gronbach and Leszek Plaskota and Joseph. F. Traub}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.09391.5}, URN = {urn:nbn:de:0030-drops-22966}, doi = {10.4230/DagSemProc.09391.5}, annote = {Keywords: Discrepancy, Numerical Integration, Quasi-Monte Carlo, Reproducing Kernel Hilbert Space} }
Published in: Dagstuhl Seminar Proceedings, Volume 8421, Uncertainty Management in Information Systems (2009)
Thomas Seidl, Emmanuel Müller, Ira Assent, and Uwe Steinhausen. Outlier detection and ranking based on subspace clustering. In Uncertainty Management in Information Systems. Dagstuhl Seminar Proceedings, Volume 8421, pp. 1-4, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
@InProceedings{seidl_et_al:DagSemProc.08421.10, author = {Seidl, Thomas and M\"{u}ller, Emmanuel and Assent, Ira and Steinhausen, Uwe}, title = {{Outlier detection and ranking based on subspace clustering}}, booktitle = {Uncertainty Management in Information Systems}, pages = {1--4}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2009}, volume = {8421}, editor = {Christoph Koch and Birgitta K\"{o}nig-Ries and Volker Markl and Maurice van Keulen}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.08421.10}, URN = {urn:nbn:de:0030-drops-19344}, doi = {10.4230/DagSemProc.08421.10}, annote = {Keywords: Outlier detection, outlier ranking, subspace clustering, data mining} }
Published in: Dagstuhl Seminar Proceedings, Volume 7181, Parallel Universes and Local Patterns (2007)
Ira Assent, Ralph Krieger, Emmanuel Müller, and Thomas Seidl. Subspace outlier mining in large multimedia databases. In Parallel Universes and Local Patterns. Dagstuhl Seminar Proceedings, Volume 7181, pp. 1-8, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2007)
@InProceedings{assent_et_al:DagSemProc.07181.10, author = {Assent, Ira and Krieger, Ralph and M\"{u}ller, Emmanuel and Seidl, Thomas}, title = {{Subspace outlier mining in large multimedia databases}}, booktitle = {Parallel Universes and Local Patterns}, pages = {1--8}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2007}, volume = {7181}, editor = {Michael R. Berthold and Katharina Morik and Arno Siebes}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.07181.10}, URN = {urn:nbn:de:0030-drops-12574}, doi = {10.4230/DagSemProc.07181.10}, annote = {Keywords: Data mining, outlier detection, subspace clustering, density-based clustering} }
Feedback for Dagstuhl Publishing