Matthias Templ

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 Alfons

> Home > Persons > Matthias Templ

Publications

2012
[j9]
- view
  authority control:
- export record
  dblp key:
  - journals/adac/TemplAF12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/adac/TemplAF12
Matthias Templ, Andreas Alfons, Peter Filzmoser:
Exploring incomplete data using visualization techniques. Adv. Data Anal. Classif. 6(1): 29-47 (2012)
2011
[j4]
- view
  authority control:
- export record
  dblp key:
  - journals/sma/AlfonsKTF11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/sma/AlfonsKTF11
Andreas Alfons, Stefan Kraft, Matthias Templ, Peter Filzmoser:
Simulation of close-to-reality population data for household surveys with application to EU-SILC. Stat. Methods Appl. 20(3): 383-407 (2011)
2010
[c5]
- view
  authority control:
- export record
  dblp key:
  - conf/psd/TemplA10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/psd/TemplA10
Matthias Templ, Andreas Alfons:
Disclosure Risk of Synthetic Population Data with Application in the Case of EU-SILC. Privacy in Statistical Databases 2010: 174-186
[c4]
- view
  authority control:
- export record
  dblp key:
  - conf/smps/AlfonsTFH10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/smps/AlfonsTFH10
Andreas Alfons, Matthias Templ, Peter Filzmoser, Josef Holzer:
A Comparison of Robust Methods for Pareto Tail Modeling in the Case of Laeken Indicators. SMPS 2010: 17-24

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.