Stop the war!

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

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

Ana Maria Tomé

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 Andreas Kodewitz

> Home > Persons > Ana Maria Tomé

Publications

2018
[j33]
- view
  authority control:
- export record
  dblp key:
  - journals/sigpro/VigneronKCTL18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/sigpro/VigneronKCTL18
Vincent Vigneron, Andreas Kodewitz, Michele Nazareth da Costa, Ana Maria Tomé, Elmar Wolfgang Lang:
Non-negative sub-tensor ensemble factorization (NsTEF) algorithm. A new incremental tensor factorization for large data sets. Signal Process. 144: 77-86 (2018)
2014
[j23]
- view
  authority control:
- export record
  dblp key:
  - journals/aada/NeubauerTKGPL14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/aada/NeubauerTKGPL14
A. Neubauer, Ana Maria Tomé, Andreas Kodewitz, J. M. Górriz, Carlos García Puntonet, Elmar Wolfgang Lang:
Bidimensional Ensemble Empirical mode Decomposition of Functional Biomedical Images. Adv. Data Sci. Adapt. Anal. 6(1) (2014)
2010
[c34]
- view
  authority control:
- export record
  dblp key:
  - conf/hais/KodewitzKTGL10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/hais/KodewitzKTGL10
Andreas Kodewitz, Ingo R. Keck, Ana Maria Tomé, Juan Manuel Górriz, Elmar Wolfgang Lang:
Exploratory Matrix Factorization for PET Image Analysis. HAIS (1) 2010: 460-467

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.