VENTURINI, ROSSANO
VENTURINI, ROSSANO
Istituto di Scienza e Tecnologie dell'Informazione "Alessandro Faedo" - ISTI
Learning bivariate scoring functions for ranking
2024 Nardini, F. M.; Trani, R.; Venturini, R.
Distilled neural networks for efficient learning to rank
2022 Nardini, Fm; Rulli, C; Trani, S; Venturini, R
Fast filtering of search results sorted by attribute
2021 Nardini F.M.; Trani R.; Venturini R.
Compressed indexes for fast search of semantic data
2020 Pibiri, G. E.; Perego, R.; Venturini, R.
Handling massive n-gram datasets efficiently
2019 Pibiri, GIULIO ERMANNO; Venturini, R
On optimally partitioning variable-byte codes
2019 Pibiri, Ge; Venturini, R
Parallel Traversal of Large Ensembles of Decision Trees
2019 Lettich, F; Lucchese, C; Nardini, Fm; Orlando, S; Perego, R; Tonellotto, N; Venturini, R
Clustered Elias-Fano Indexes
2017 Pibiri, Ge; Venturini, R
Compressed Cache-Oblivious String B-Tree
2016 Ferragina, P.; Venturini R.
Compressed String Dictionary Search with Edit Distance One
2016 Belazzougui D.; Venturini R.
Space-Efficient Substring Occurrence Estimation
2016 Orlandi, A; Venturini, R
Distribution-aware compressed full-text indexes
2013 Ferragina, P; Sìren, J; Venturini, R
On the bit-complexity of Lempel-Ziv compression
2013 Ferragina P.; Nitto I.; Venturini R.
On optimally partitioning a text to improve its compression
2011 Ferragina, P; Nitto, I; Venturini, R
On compact representations of all-pairs-shortest-path-distance matrices
2010 Ferragina P.; Nitto I.; Venturini R.
The compressed permuterm index
2010 Ferragina, P; Venturini, R
| Titolo | Data di pubblicazione | Autore(i) | File |
|---|---|---|---|
| Learning bivariate scoring functions for ranking | 1-gen-2024 | Nardini, F. M.; Trani, R.; Venturini, R. | |
| Distilled neural networks for efficient learning to rank | 1-gen-2022 | Nardini, Fm; Rulli, C; Trani, S; Venturini, R | |
| Fast filtering of search results sorted by attribute | 1-gen-2021 | Nardini F.M.; Trani R.; Venturini R. | |
| Compressed indexes for fast search of semantic data | 1-gen-2020 | Pibiri, G. E.; Perego, R.; Venturini, R. | |
| Handling massive n-gram datasets efficiently | 1-gen-2019 | Pibiri, GIULIO ERMANNO; Venturini, R | |
| On optimally partitioning variable-byte codes | 1-gen-2019 | Pibiri, Ge; Venturini, R | |
| Parallel Traversal of Large Ensembles of Decision Trees | 1-gen-2019 | Lettich, F; Lucchese, C; Nardini, Fm; Orlando, S; Perego, R; Tonellotto, N; Venturini, R | |
| Clustered Elias-Fano Indexes | 1-gen-2017 | Pibiri, Ge; Venturini, R | |
| Compressed Cache-Oblivious String B-Tree | 1-gen-2016 | Ferragina, P.; Venturini R. | |
| Compressed String Dictionary Search with Edit Distance One | 1-gen-2016 | Belazzougui D.; Venturini R. | |
| Space-Efficient Substring Occurrence Estimation | 1-gen-2016 | Orlandi, A; Venturini, R | |
| Distribution-aware compressed full-text indexes | 1-gen-2013 | Ferragina, P; Sìren, J; Venturini, R | |
| On the bit-complexity of Lempel-Ziv compression | 1-gen-2013 | Ferragina P.; Nitto I.; Venturini R. | |
| On optimally partitioning a text to improve its compression | 1-gen-2011 | Ferragina, P; Nitto, I; Venturini, R | |
| On compact representations of all-pairs-shortest-path-distance matrices | 1-gen-2010 | Ferragina P.; Nitto I.; Venturini R. | |
| The compressed permuterm index | 1-gen-2010 | Ferragina, P; Venturini, R |