Georges Hébrail

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 Nesrine Gabsi

> Home > Persons > Georges Hébrail

Publications

2010
[c28]
- view
  - electronic edition @ editions-rnti.fr
  - no references & citations available
- export record
  dblp key:
  - conf/f-egc/GabsiCH10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/f-egc/GabsiCH10
Nesrine Gabsi, Fabrice Clérot, Georges Hébrail:
Interrogation des résumés de flux de données. EGC 2010: 247-254
[c25]
- view
  authority control:
- export record
  dblp key:
  - conf/pakdd/GabsiCH10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/pakdd/GabsiCH10
Nesrine Gabsi, Fabrice Clérot, Georges Hébrail:
Efficient Trade-Off between Speed Processing and Accuracy in Summarizing Data Streams. PAKDD (2) 2010: 343-353
2009
[c23]
- view
  authority control:
- export record
  dblp key:
  - conf/egc/GabsiCH09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/egc/GabsiCH09
Nesrine Gabsi, Fabrice Clérot, Georges Hébrail:
An Hybrid Data Stream Summarizing Approach by Sampling and Clustering. EGC (best of volume) 2009: 181-200
[c21]
- view
  - electronic edition @ editions-rnti.fr
  - no references & citations available
- export record
  dblp key:
  - conf/f-egc/GabsiCH09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/f-egc/GabsiCH09
Nesrine Gabsi, Fabrice Clérot, Georges Hébrail:
Résumé hybride de flux de données par échantillonnage et classification automatique. EGC 2009: 229-240

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.