Zobrazeno 1 - 6
of 6
pro vyhledávání: '"Jannis Bulian"'
Autor:
Jordan Boyd-Graber, Jannis Bulian, Bhuwan Dhingra, Benjamin Börschinger, Julian Martin Eisenschlos
Publikováno v:
NAACL-HLT
We release FoolMeTwice (FM2 for short), a large dataset of challenging entailment pairs collected through a fun multi-player game. Gamification encourages adversarial examples, drastically lowering the number of examples that can be solved using "sho
Autor:
Arjun Gopalan, Qin Cao, Chris Bregler, Georg Fritz Osang, Vaiva Imbrasaite, Jannis Bulian, Ricardo Abasolo Marino, Gabriel Ilharco, Roma Patel, Lucas Smaira, Gabriel Fedrigo Barcik, Afsaneh Hajiamin Shirazi, Felipe Ferreira, Jared Frank, Arsha Nagrani, Cesar Ilharco, Blaz Bratanic, Thomas Leung, Christina Funk
Publikováno v:
Proceedings of the 59th Annual Meeting of the Association for Computational Linguistics and the 11th International Joint Conference on Natural Language Processing: Tutorial Abstracts.
How information is created, shared and consumed has changed rapidly in recent decades, in part thanks to new social platforms and technologies on the web. With ever-larger amounts of unstructured and limited labels, organizing and reconciling informa
Autor:
Jannis Bulian, Anuj Dawar
We show that for various classes \(\mathcal {C}\) of sparse graphs, and several measures of distance to such classes (such as edit distance and elimination distance), the problem of determining the distance of a given graph G to \(\mathcal {C}\) is f
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::bc16f6bfe3e47e0f94a3940c39e1e0a4
Autor:
Jannis Bulian
This dissertation offers contributions to the area of parameterized complexity theory, which studies the complexity of computational problems in a multivariate framework. We demonstrate that for graph problems, many popular parameters can be understo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::32966f94808c6dce17184cbe824bfc71
Autor:
Jannis Bulian, Ian Hodkinson
Publikováno v:
Annals of Pure and Applied Logic. 164:884-906
We show that for finite n ⩾ 3 , every first-order axiomatisation of the varieties of representable n-dimensional cylindric algebras, diagonal-free cylindric algebras, polyadic algebras, and polyadic equality algebras contains an infinite number of
Autor:
Jannis Bulian, Anuj Dawar
Publikováno v:
Parameterized and Exact Computation ISBN: 9783319135236
IPEC
IPEC
A commonly studied means of parameterizing graph problems is the deletion distance from triviality (Guo et al. 2004), which counts vertices that need to be deleted from a graph to place it in some class for which efficient algorithms are known. In th