Published in: OASIcs, Volume 74, 8th Symposium on Languages, Applications and Technologies (SLATE 2019)
Christopher Dane Shulby, Martha Dais Ferreira, Rodrigo F. de Mello, and Sandra Maria Aluisio. Robust Phoneme Recognition with Little Data. In 8th Symposium on Languages, Applications and Technologies (SLATE 2019). Open Access Series in Informatics (OASIcs), Volume 74, pp. 4:1-4:11, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{shulby_et_al:OASIcs.SLATE.2019.4, author = {Shulby, Christopher Dane and Ferreira, Martha Dais and de Mello, Rodrigo F. and Aluisio, Sandra Maria}, title = {{Robust Phoneme Recognition with Little Data}}, booktitle = {8th Symposium on Languages, Applications and Technologies (SLATE 2019)}, pages = {4:1--4:11}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-95977-114-6}, ISSN = {2190-6807}, year = {2019}, volume = {74}, editor = {Rodrigues, Ricardo and Janou\v{s}ek, Jan and Ferreira, Lu{\'\i}s and Coheur, Lu{\'\i}sa and Batista, Fernando and Gon\c{c}alo Oliveira, Hugo}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.SLATE.2019.4}, URN = {urn:nbn:de:0030-drops-108715}, doi = {10.4230/OASIcs.SLATE.2019.4}, annote = {Keywords: feature extraction, acoustic modeling, phoneme recognition, statistical learning theory} }
Published in: LIPIcs, Volume 52, 1st International Conference on Formal Structures for Computation and Deduction (FSCD 2016)
Fer-Jan de Vries. On Undefined and Meaningless in Lambda Definability. In 1st International Conference on Formal Structures for Computation and Deduction (FSCD 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 52, pp. 18:1-18:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{devries:LIPIcs.FSCD.2016.18, author = {de Vries, Fer-Jan}, title = {{On Undefined and Meaningless in Lambda Definability}}, booktitle = {1st International Conference on Formal Structures for Computation and Deduction (FSCD 2016)}, pages = {18:1--18:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-010-1}, ISSN = {1868-8969}, year = {2016}, volume = {52}, editor = {Kesner, Delia and Pientka, Brigitte}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.FSCD.2016.18}, URN = {urn:nbn:de:0030-drops-59785}, doi = {10.4230/LIPIcs.FSCD.2016.18}, annote = {Keywords: lambda calculus, lambda definability, partial recursive function, undefined term, meaningless term} }
Published in: Dagstuhl Reports, Volume 5, Issue 11 (2016)
Ada Diaconescu, Stepehn Marsh, Jeremy Pitt, Wolfgang Reif, and Jan-Philipp Steghöfer. Social Concepts in Self-organising Systems (Dagstuhl Seminar 15482). In Dagstuhl Reports, Volume 5, Issue 11, pp. 127-150, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@Article{diaconescu_et_al:DagRep.5.11.127, author = {Diaconescu, Ada and Marsh, Stepehn and Pitt, Jeremy and Reif, Wolfgang and Stegh\"{o}fer, Jan-Philipp}, title = {{Social Concepts in Self-organising Systems (Dagstuhl Seminar 15482)}}, pages = {127--150}, journal = {Dagstuhl Reports}, ISSN = {2192-5283}, year = {2016}, volume = {5}, number = {11}, editor = {Diaconescu, Ada and Marsh, Stepehn and Pitt, Jeremy and Reif, Wolfgang and Stegh\"{o}fer, Jan-Philipp}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagRep.5.11.127}, URN = {urn:nbn:de:0030-drops-57954}, doi = {10.4230/DagRep.5.11.127}, annote = {Keywords: computational justice, multi-agent sytems, norms, organic computing, reputation, self-organisation, social capital, socio-technical systems, sociologically-inspired computing, trust} }
Published in: LIPIcs, Volume 35, 6th Conference on Algebra and Coalgebra in Computer Science (CALCO 2015)
Alexander Kurz, Alberto Pardo, Daniela Petrisan, Paula Severi, and Fer-Jan de Vries. Approximation of Nested Fixpoints – A Coalgebraic View of Parametric Dataypes. In 6th Conference on Algebra and Coalgebra in Computer Science (CALCO 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 35, pp. 205-220, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{kurz_et_al:LIPIcs.CALCO.2015.205, author = {Kurz, Alexander and Pardo, Alberto and Petrisan, Daniela and Severi, Paula and de Vries, Fer-Jan}, title = {{Approximation of Nested Fixpoints – A Coalgebraic View of Parametric Dataypes}}, booktitle = {6th Conference on Algebra and Coalgebra in Computer Science (CALCO 2015)}, pages = {205--220}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-84-2}, ISSN = {1868-8969}, year = {2015}, volume = {35}, editor = {Moss, Lawrence S. and Sobocinski, Pawel}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CALCO.2015.205}, URN = {urn:nbn:de:0030-drops-55351}, doi = {10.4230/LIPIcs.CALCO.2015.205}, annote = {Keywords: coalgebra, Bekic lemma, infinite data, functional programming, type theory} }
Published in: LIPIcs, Volume 15, 23rd International Conference on Rewriting Techniques and Applications (RTA'12) (2012)
Paula Severi and Fer-Jan de Vries. Meaningless Sets in Infinitary Combinatory Logic. In 23rd International Conference on Rewriting Techniques and Applications (RTA'12). Leibniz International Proceedings in Informatics (LIPIcs), Volume 15, pp. 288-304, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)
@InProceedings{severi_et_al:LIPIcs.RTA.2012.288, author = {Severi, Paula and de Vries, Fer-Jan}, title = {{Meaningless Sets in Infinitary Combinatory Logic}}, booktitle = {23rd International Conference on Rewriting Techniques and Applications (RTA'12)}, pages = {288--304}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-38-5}, ISSN = {1868-8969}, year = {2012}, volume = {15}, editor = {Tiwari, Ashish}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.RTA.2012.288}, URN = {urn:nbn:de:0030-drops-34993}, doi = {10.4230/LIPIcs.RTA.2012.288}, annote = {Keywords: Infinitary Rewriting, Combinatory Logic, Meaningless Sets, Confluence, Normalisation} }
Published in: LIPIcs, Volume 10, 22nd International Conference on Rewriting Techniques and Applications (RTA'11) (2011)
Paula Severi and Fer-Jan de Vries. Weakening the Axiom of Overlap in Infinitary Lambda Calculus. In 22nd International Conference on Rewriting Techniques and Applications (RTA'11). Leibniz International Proceedings in Informatics (LIPIcs), Volume 10, pp. 313-328, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
@InProceedings{severi_et_al:LIPIcs.RTA.2011.313, author = {Severi, Paula and de Vries, Fer-Jan}, title = {{Weakening the Axiom of Overlap in Infinitary Lambda Calculus}}, booktitle = {22nd International Conference on Rewriting Techniques and Applications (RTA'11)}, pages = {313--328}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-30-9}, ISSN = {1868-8969}, year = {2011}, volume = {10}, editor = {Schmidt-Schauss, Manfred}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.RTA.2011.313}, URN = {urn:nbn:de:0030-drops-31312}, doi = {10.4230/LIPIcs.RTA.2011.313}, annote = {Keywords: Infinitary Lambda Calculus, Confluence, Normalization} }
Feedback for Dagstuhl Publishing