Search results

  • Full text

  • Document type

    • Publication year

  • Organisation

Results: 76,949
Number of items: 76,949
  • Open Access
    Hoepner, N., Tiddi, I., & van Hoof, H. (2025). Data Augmentation for Instruction Following Policies via Trajectory Segmentation. In T. Walsh, J. Shah, & Z. Kolter (Eds.), Proceedings of the 39th Annual AAAI Conference on Artificial Intelligence: February 25-March 4, 2025, Philadelphia, Pennsylvania, USA (Vol. 16, pp. 17214-17222). AAAI Press. https://doi.org/10.1609/aaai.v39i16.33892
  • Open Access
    Hoepner, N., Kuric, D., & van Hoof, H. (2025). Making Universal Policies Universal. In Y. Vorobeychik, S. Das, & A. Nowe (Eds.), AAMAS '25: Proceedings of the 24th International Conference on Autonomous Agents and Multiagent Systems : May 19-23, 2025, Detroit, Michigan, USA (pp. 2553-2555). International Foundation for Autonomous Agents and Multiagent Systems. https://doi.org/10.48550/arXiv.2502.14777
  • Open Access
    Resch, N., Yuan, C., & Zhang, Y. (2025). Tight Bounds on List-Decodable and List-Recoverable Zero-Rate Codes. In R. Meka (Ed.), 16th Innovations in Theoretical Computer Science Conference: ITCS 2025, January 7-10, 2025, Columbia University, New York, NY, USA Article 82 (Leibniz International Proceedings in Informatics; Vol. 325). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ITCS.2025.82, https://doi.org/10.48550/arXiv.2309.01800
  • Open Access
    Doron, D., Mosheiff, J., Resch, N., & Ribeiro, J. (2025). List-Recovery of Random Linear Codes over Small Fields. In A. Ene, & E. Chattopadhyay (Eds.), Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques: APPROX/RANDOM 2025, August 11-13, 2025, Berkeley, CA, USA Article 57 (Leibniz International Proceedings in Informatics; Vol. 353). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2025.57, https://doi.org/10.48550/arXiv.2505.05935
  • Open Access
    Mosheiff, J., Resch, N., Shang, K., & Yuan, C. (2025). Randomness-Efficient Constructions of Capacity-Achieving List-Decodable Codes. In 2025 IEEE International Symposium on Information Theory (ISIT 2025): Ann Arbor, Michigan, USA, 22-27 June 2025 (pp. 240-245). IEEE. https://doi.org/10.1109/ISIT63088.2025.11195274
  • Open Access
    Bombar, M., Resch, N., & Wiedijk, E. (2025). On the Independence Assumption in Quasi-Cyclic Code-Based Cryptography. In 2025 IEEE International Symposium on Information Theory (ISIT 2025): Ann Arbor, Michigan, USA, 22-27 June 2025 (pp. 294-299). IEEE. https://doi.org/10.1109/ISIT63088.2025.11195347
  • Open Access
    Stam, O. J. M., Francis, K. J., & Awasthi, N. (2025). PA OmniNet: A retraining-free, generalizable deep learning framework for robust photoacoustic image reconstruction. Photoacoustics, 45, Article 100740. https://doi.org/10.1016/j.pacs.2025.100740
  • Open Access
    Fahrenfort, J. J., Johnson, P. A., Kloosterman, N., Stein, T., & van Gaal, S. (2025). Response to comment on 'Criterion placement threatens the construct validity of neural measures of consciousness'. eLife, 14, Article e107622. https://doi.org/10.7554/eLife.107622
  • Open Access
    Fahrenfort, J. J., Johnson, P. A., Kloosterman, N. A., Stein, T., & van Gaal, S. (2025). Criterion placement threatens the construct validity of neural measures of consciousness. eLife, 13, Article RP102335. https://doi.org/10.7554/eLife.102335
  • Open Access
    Sánchez-Fuenzalida, N., van Gaal, S., Fleming, S. M., Haaf, J. M., & Fahrenfort, J. J. (2025). Confidence reports during perceptual decision making dissociate from changes in subjective experience. Communications psychology, 3, Article 81. https://doi.org/10.1038/s44271-025-00257-y
Page 185 of 7695