Author of the publication

Theano: A Python framework for fast computation of mathematical expressions.

, , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , and . CoRR, (2016)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

IVOA Recommendation: IVOA Support Interfaces, and . CoRR, (2011)An Interactive Tool for Experimenting with Bounded-Degree Plane Geometric Spanners (Media Exposition)., , , , and . SoCG, volume 189 of LIPIcs, page 61:1-61:4. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Human-Technology Frontier: Measuring Student Performance-Related Responses to Authentic Engineering Education Activities via Physiological Sensing., , , and . AHFE (8), volume 266 of Lecture Notes in Networks and Systems, page 338-345. Springer, (2021)Two c's in a pod: Cosmology independent measurement of the Type Ia supernova colour-luminosity relation with a sibling pair, , , , , , , , , and 12 other author(s). (2021)cite arxiv:2103.16978Comment: 11 pages, 8 figures.Experiments with unit disk cover algorithms for covering massive pointsets., , , , and . Comput. Geom., (2023)Users in the loop: a psychologically-informed approach to similar item retrieval., , , , and . RecSys, page 52-59. ACM, (2019)Recommendation or Discrimination?: Quantifying Distribution Parity in Information Retrieval Systems., , , , and . CoRR, (2019)Life-cycle service and the family unit in early modern rye. Continuity and Change, 6 (2): 201-226 (1991)Bounded-Degree Plane Geometric Spanners in Practice., , , , and . ACM J. Exp. Algorithmics, (December 2023)Experiments with Unit Disk Cover Algorithms for Covering Massive Pointsets., , , , and . CoRR, (2022)