Uemura, T. (2019) Cubical Assemblies, a Univalent and Impredicative Universe and a Failure of Propositional Resizing.

In Dybjer, P. Espírito Santo, J. Pinto, L. (Eds.), 24th International Conference on Types for Proofs and Programs: TYPES 2018, June 18-21, 2018, Braga, Portugal (Leibniz International Proceedings in Informatics, Vol. 130). Schloss Dagstuhl - Leibniz-Zentrum für Informatik.

Uemura, T. (2019) A General Framework for the Semantics of Type Theory.

Abstract | UvA-DARE

Uemura, T. (2019) Cubical Assembly Models of Homotopy Type Theory.

Abstract | UvA-DARE

Uemura, T. (2019) A General Framework for the Semantics of Type Theory.

Abstract | UvA-DARE

Uemura, T. (2019) A General Framework for Categorical Semantics of Type Theory.

Abstract | UvA-DARE

Uemura, T. (2020) Abstract type theories.

Abstract | UvA-DARE

Uemura, T. (2020) The Universal Exponentiable Arrow.

Journal of Pure and Applied Algebra

Article | UvA-DARE

Uemura, T. (2021) Abstract and concrete type theories.

ILLC dissertation series. Institute for Logic, Language and Computation.

Thesis, fully internal | UvA-DARE

Uijlings, J.R.R., Smeulders, A.W.M., Scha, R.J.H. (2009) Real-time bag of words, approximately.

In Marchand-Maillet, S. Kompatsiaris, I. (Eds.), Proceedings of the ACM International Conference on Image and Video Retrieval, ACM-CIVR 2009: July 8-10, 2009 - Santorini Island, Greece (pp 6). Association for Computing Machinery (ACM).

Uijlings, J.R.R., Smeulders, A.W.M., Scha, R.J.H. (2009) What is the spatial extent of an object?.

In 2009 IEEE Conference on Computer Vision and Pattern Recognition, CVPR 2009: Miami, Florida, USA, 20-25 June 2009 (pp 770-777). IEEE.

Uijlings, J.R.R., Smeulders, A.W.M., Scha, R.J.H. (2010) Real-time visual concept classification.

IEEE Transactions on Multimedia, Vol. 12 (pp 665-681)

Article | https://doi.org/10.1109/TMM.2010.2052027 | UvA-DARE

Ulmer, D., Cina, G. (2021) Know Your Limits: Uncertainty Estimation with ReLU Classifiers Fails at Reliable OOD Detection.

Proceedings of Machine Learning Research, Vol. 161 (pp 1766-1776)

Article | https://doi.org/10.48550/arXiv.2012.05329 | UvA-DARE

Ulmer, D., Hupkes, D., Bruni, E. (2019) Assessing incrementality in sequence-to-sequence models.

In Augenstein, I. Gella, S. Ruder, S. Kann, K. Can, B. Welbl, J. Conneau, A. Ren, X. Rei, M. (Eds.), The 4th Workshop on Representation Learning for NLP (RepL4NLP-2019): ACL 2019 : proceedings of the workshop : August 2, 2019, Florence, Italy (pp 209–217). The Association for Computational Linguistics.

Umanski, D., Schiller, N.O., Sangati, F. (2010) How spoken language corpora can refine current speech motor training methodologies.

In Proceedings of the ACL 2010 Student Research Workshop, Uppsala, Sweden (pp 37-42). Association for Computational Linguistics (ACL).

Unger, F.P. (2006) On Small Hard Leaf Languages.

In 30th International Symposium on Mathematical Foundations of Computer Science (pp 781-792)

Unger, F.P. (2008) Noise in quantum and classical computation & non-locality.

Institute for Logic, Language and Computation.

Thesis, fully internal | UvA-DARE

Unger, Falk (2008) Noise threshold for universality of two-input gates.

IEEE Transactions on Information Theory, Vol. 54 (pp 3693-3698)

Article | https://doi.org/10.1109/TIT.2008.926459 | UvA-DARE

Urbański, M., van Lambalgen, M., Koszowy, M. (2017) An introduction to the special issue on question processing.

Logic and Logical Philosophy, Vol. 26 (pp 285-288)

Editorial | https://doi.org/10.12775/LLP.2017.025 | UvA-DARE

v. Gool, S.J., Reggio, L. (2018) An open mapping theorem for finitely copresented Esakia spaces.

Topology and its Applications, Vol. 240 (pp 69-77)

Article | https://doi.org/10.1016/j.topol.2018.03.006 | UvA-DARE

v. Gool, S.J., Steinberg, B. (2017) Pro-aperiodic monoids via saturated models.

In Vollmer, H. Vallée, B. (Eds.), 34th Symposium on Theoretical Aspects of Computer Science: STACS 2017, March 8-11, 2017, Hannover, Germany (Leibniz International Proceedings in Informatics, Vol. 66). Schloss Dagstuhl - Leibniz-Zentrum für Informatik.