Niklas Smedemark-Margulies

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 Aziz Kocanaogullari

> Home > Persons > Niklas Smedemark-Margulies

Publications

2023
[c2]
- view
  authority control:
- export record
  dblp key:
  - conf/icassp/SmedemarkMarguliesCIKE23
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icassp/SmedemarkMarguliesCIKE23
Niklas Smedemark-Margulies, Basak Celik, Tales Imbiriba, Aziz Kocanaogullari, Deniz Erdogmus:
Recursive Estimation of User Intent From Noninvasive Electroencephalography Using Discriminative Models. ICASSP 2023: 1-5
2022
[i4]
- view
  - electronic edition via DOI (open access)
  - details & citations
  authority control:
- export record
  dblp key:
  - journals/corr/abs-2211-02630
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2211-02630
Niklas Smedemark-Margulies, Basak Celik, Tales Imbiriba, Aziz Kocanaogullari, Deniz Erdogmus:
Recursive Estimation of User Intent from Noninvasive Electroencephalography using Discriminative Models. CoRR abs/2211.02630 (2022)
2021
[j1]
- view
  authority control:
- export record
  dblp key:
  - journals/spl/KocanaogullariS21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/spl/KocanaogullariS21
Aziz Koçanaogullari, Niklas Smedemark-Margulies, Murat Akçakaya, Deniz Erdogmus:
Geometric Analysis of Uncertainty Sampling for Dense Neural Network Layer. IEEE Signal Process. Lett. 28: 867-871 (2021)

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.