Andrei Popescu-Belis

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 Denis Lalanne

> Home > Persons > Andrei Popescu-Belis

Publications

2012
[j7]
- view
  authority control:
- export record
  dblp key:
  - journals/ieeemm/Popescu-BelisLB12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ieeemm/Popescu-BelisLB12
Andrei Popescu-Belis, Denis Lalanne, Hervé Bourlard:
Finding Information in Multimedia Meeting Records. IEEE Multim. 19(2): 48-57 (2012)
2005
[c20]
- view
  authority control:
- export record
  dblp key:
  - conf/mlmi/Popescu-BelisL05
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/mlmi/Popescu-BelisL05
Andrei Popescu-Belis, Denis Lalanne:
Detection and Resolution of References to Meeting Documents. MLMI 2005: 64-75
2004
[c14]
- view
  authority control:
- export record
  dblp key:
  - conf/mlmi/LalanneIRBMP04
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/mlmi/LalanneIRBMP04
Denis Lalanne, Rolf Ingold, Didier von Rotz, Ardhendu Behera, Dalila Mekhaldi, Andrei Popescu-Belis:
Using Static Documents as Structured and Thematic Interfaces to Multimedia Meeting Archives. MLMI 2004: 87-100
[c13]
- view
  authority control:
- export record
  dblp key:
  - conf/mlmi/Popescu-BelisCGLZ04
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/mlmi/Popescu-BelisCGLZ04
Andrei Popescu-Belis, Alexander Clark, Maria Georgescul, Denis Lalanne, Sandrine Zufferey:
Shallow Dialogue Processing Using Machine Learning Algorithms (or Not). MLMI 2004: 277-290

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.