Florian Poulin

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 Laura Elena Raileanu

> Home > Persons > Florian Poulin

Publications

2009
[c2]
- no documents available
  - no references & citations available
- export record
  dblp key:
  - conf/ic3k/FatemiPRS09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ic3k/FatemiPRS09
Nastaran Fatemi, Florian Poulin, Laura Elena Raileanu, Alan F. Smeaton:
Using Association Rule Mining to Enrich Semantic Concepts for Video Retrieval. KDIR 2009: 119-126
2008
[c1]
- view
  - electronic edition @ nist.gov (open access)
  - no references & citations available
- export record
  dblp key:
  - conf/trecvid/ZhangCDPTAKMSMBSEAAGPACGMFPRJPVMKNDMMKNH08
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/trecvid/ZhangCDPTAKMSMBSEAAGPACGMFPRJPVMKNDMMKNH08
Qianni Zhang, Krishna Chandramouli, Uros Damnjanovic, Tomas Piatrik, Giorgos Tolias, Yannis Avrithis, Petros Kapsalas, Phivos Mylonas, Evaggelos Spyrou, Boris Mansencal, Jenny Benois-Pineau, Ahmet Saracoglu, Ersin Esen, A. Aydin Alatan, Naiara Aginako, I. Garcia, António M. G. Pinheiro, Luís A. Alexandre, Marzia Corvaglia, Fabrizio Guerrini, Pierangelo Migliorati, Nastaran Fatemi, Florian Poulin, Laura Elena Raileanu, Roman Jarina, Martin Paralic, Stefanos Vrochidis, Anastasia Moumtzidou, Paul King, Spiros Nikolopoulos, Anastasios Dimou, Vasileios Mezaris, Lambros Makris, Ioannis Kompatsiaris, Suphi Umut Naci, Alan Hanjalic:
COST292 experimental framework for TRECVID2008. TRECVID 2008

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.