( en | de | ru )

 

Disambiguation of "Subercaseaux, Bernardo"

Author of the publication

copydeleteadd this publication to your clipboard
Expressiveness of Matrix and Tensor Query Languages in terms of ML Operators.

, , , and . DEEM@SIGMOD, page 9:1-9:5. ACM, (2019)

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.

Bernardo

Bernardo Fritzsche

Sergio Bernardo

Angelika Bernardo

Bernardo Fünfgeld

 

Other publications of authors with the same name

A Symbolic Language for Interpreting Decision Trees., , , , and . CoRR, (2023)Model Interpretability through the lens of Computational Complexity., , , and . NeurIPS, (2020)The Packing Chromatic Number of the Infinite Square Grid Is at Least 14., and . SAT, volume 236 of LIPIcs, page 21:1-21:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)The Computational Complexity of Evil Hangman., and . CoRR, (2020)Augmenting Online Algorithms with $\varepsilon$-Accurate Predictions., , , and . NeurIPS, (2022)On the Expressiveness of LARA: A Unified Language for Linear and Relational Algebra., , , and . ICDT, volume 155 of LIPIcs, page 6:1-6:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Assortment Optimization For Conference Goodies With Indifferent Attendees., and . CoRR, (2024)Sometimes Hoarding is Harder than Cleaning: NP-hardness of Maximum Blocked-Clause Addition.. LPAR, volume 100 of EPiC Series in Computing, page 408-425. EasyChair, (2024)Expressiveness of Matrix and Tensor Query Languages in terms of ML Operators., , , and . DEEM@SIGMOD, page 9:1-9:5. ACM, (2019)On Computing Probabilistic Explanations for Decision Trees., , , and . NeurIPS, (2022)