Mario Paolucci

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 Roberto Beraldi

> Home > Persons > Mario Paolucci

Publications

2017
[j21]
- view
  authority control:
- export record
  dblp key:
  - journals/fgcs/PetroniQBP17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/fgcs/PetroniQBP17
Fabio Petroni, Leonardo Querzoni, Roberto Beraldi, Mario Paolucci:
Exploiting user feedback for online filtering in event-based systems. Future Gener. Comput. Syst. 71: 202-211 (2017)
2016
[j19]
- view
  authority control:
- export record
  dblp key:
  - journals/jss/PetroniQBP16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jss/PetroniQBP16
Fabio Petroni, Leonardo Querzoni, Roberto Beraldi, Mario Paolucci:
LCBM: a fast and lightweight collaborative filtering algorithm for binary ratings. J. Syst. Softw. 117: 583-594 (2016)
[c25]
- view
  authority control:
- export record
  dblp key:
  - conf/sac/PetroniQBP16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/sac/PetroniQBP16
Fabio Petroni, Leonardo Querzoni, Roberto Beraldi, Mario Paolucci:
Exploiting user feedback for online filtering in event-based systems. SAC 2016: 2021-2026
2014
[c24]
- view
  authority control:
- export record
  dblp key:
  - conf/bis/PetroniQBP14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/bis/PetroniQBP14
Fabio Petroni, Leonardo Querzoni, Roberto Beraldi, Mario Paolucci:
LCBM: Statistics-Based Parallel Collaborative Filtering. BIS 2014: 172-184

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.