François Fleuret

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Karthigan Sinnathamby

> Home > Persons > François Fleuret

Publications

2021
[i43]
- view
  - electronic edition @ arxiv.org (open access)
  - details & citations
- export record
  dblp key:
  - journals/corr/abs-2101-09512
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2101-09512
Karthigan Sinnathamby, Chang-Yu Hou, Lalitha Venkataramanan, Vasileios-Marios Gkortsas, François Fleuret:
Unsupervised clustering of series using dynamic programming. CoRR abs/2101.09512 (2021)
[i42]
- view
  - electronic edition @ arxiv.org (open access)
  - details & citations
- export record
  dblp key:
  - journals/corr/abs-2101-10983
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2101-10983
Karthigan Sinnathamby, Chang-Yu Hou, Lalitha Venkataramanan, Vasileios-Marios Gkortsas, François Fleuret:
Unsupervised clustering of series using dynamic programming and neural processes. CoRR abs/2101.10983 (2021)
2020
[i35]
- view
  - electronic edition @ arxiv.org (open access)
  - details & citations
- export record
  dblp key:
  - journals/corr/abs-2002-03240
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2002-03240
Vincent Micheli, Karthigan Sinnathamby, François Fleuret:
Multi-task Reinforcement Learning with a Planning Quasi-Metric. CoRR abs/2002.03240 (2020)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.