Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

Jan Beutel

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 Timo Farei-Campagna

> Home > Persons > Jan Beutel

Publications

2019
[c57]
- view
  authority control:
- export record
  dblp key:
  - conf/ipsn/0005FPFGFVWBT19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ipsn/0005FPFGFVWBT19
Matthias Meyer, Timo Farei-Campagna, Akos Pasztor, Reto Da Forno, Tonio Gsell, Jérome Faillettaz, Andreas Vieli, Samuel Weber, Jan Beutel, Lothar Thiele:
Event-triggered natural hazard monitoring with convolutional neural networks on the edge. IPSN 2019: 73-84
[c54]
- view
  authority control:
- export record
  dblp key:
  - conf/ipsn/0005FPFBT19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ipsn/0005FPFBT19
Matthias Meyer, Timo Farei-Campagna, Akos Pasztor, Reto Da Forno, Jan Beutel, Lothar Thiele:
How many climb the matterhorn?: demo abstract. IPSN 2019: 350-351
2018
[i3]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-1810-09409
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-1810-09409
Matthias Meyer, Timo Farei-Campagna, Akos Pasztor, Reto Da Forno, Tonio Gsell, Samuel Weber, Jan Beutel, Lothar Thiele:
Event-triggered Natural Hazard Monitoring with Convolutional Neural Networks on the Edge. CoRR abs/1810.09409 (2018)

a service of

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.