Stop the war!

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

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

Franco Maria Nardini

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 Fernando Loor

> Home > Persons > Franco Maria Nardini

Publications

2022
[c77]
- view
  authority control:
- export record
  dblp key:
  - conf/ecir/Gil-CostaLMNPT22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ecir/Gil-CostaLMNPT22
Veronica Gil-Costa, Fernando Loor, Romina Molina, Franco Maria Nardini, Raffaele Perego, Salvatore Trani:
Ensemble Model Compression for Fast and Energy-Efficient Ranking on FPGAs. ECIR (1) 2022: 260-273
[c75]
- view
  - electronic edition @ ceur-ws.org (open access)
  - no references & citations available
- export record
  dblp key:
  - conf/iir/Gil-CostaLMN0T22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/iir/Gil-CostaLMN0T22
Veronica Gil-Costa, Fernando Loor, Romina Molina, Franco Maria Nardini, Raffaele Perego, Salvatore Trani:
Energy-Efficient Ranking on FPGAs through Ensemble Model Compression (Abstract). IIR 2022
2021
[j16]
- view
  authority control:
- export record
  dblp key:
  - journals/jpdc/MolinaLGNPT21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jpdc/MolinaLGNPT21
Romina Molina, Fernando Loor, Veronica Gil-Costa, Franco Maria Nardini, Raffaele Perego, Salvatore Trani:
Efficient traversal of decision tree ensembles with FPGAs. J. Parallel Distributed Comput. 155: 38-49 (2021)

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.