NARDINI, FRANCO MARIA
 Distribuzione geografica
Continente #
AS - Asia 3.849
NA - Nord America 2.251
EU - Europa 1.205
SA - Sud America 729
AF - Africa 61
OC - Oceania 7
Continente sconosciuto - Info sul continente non disponibili 2
Totale 8.104
Nazione #
US - Stati Uniti d'America 2.096
SG - Singapore 1.669
CN - Cina 886
BR - Brasile 587
IT - Italia 436
VN - Vietnam 415
HK - Hong Kong 331
FR - Francia 193
KR - Corea 137
JP - Giappone 120
NL - Olanda 94
DE - Germania 87
FI - Finlandia 82
IN - India 82
GB - Regno Unito 77
CA - Canada 68
AR - Argentina 58
AT - Austria 55
BD - Bangladesh 43
RU - Federazione Russa 37
MX - Messico 36
IL - Israele 26
ID - Indonesia 25
PL - Polonia 24
SE - Svezia 21
EC - Ecuador 19
IQ - Iraq 19
CO - Colombia 18
MY - Malesia 16
ZA - Sudafrica 15
TR - Turchia 14
ES - Italia 12
GR - Grecia 12
CR - Costa Rica 11
CL - Cile 10
JM - Giamaica 10
KE - Kenya 10
MA - Marocco 10
PY - Paraguay 10
VE - Venezuela 10
IE - Irlanda 9
PK - Pakistan 9
UA - Ucraina 9
LT - Lituania 8
PE - Perù 8
SA - Arabia Saudita 8
UZ - Uzbekistan 8
CH - Svizzera 7
UY - Uruguay 7
HU - Ungheria 6
JO - Giordania 6
TT - Trinidad e Tobago 6
TW - Taiwan 6
PT - Portogallo 5
CZ - Repubblica Ceca 4
DO - Repubblica Dominicana 4
DZ - Algeria 4
EG - Egitto 4
HN - Honduras 4
NZ - Nuova Zelanda 4
RS - Serbia 4
SV - El Salvador 4
TH - Thailandia 4
TN - Tunisia 4
AL - Albania 3
AM - Armenia 3
AU - Australia 3
AZ - Azerbaigian 3
BE - Belgio 3
ET - Etiopia 3
KZ - Kazakistan 3
PH - Filippine 3
BO - Bolivia 2
BZ - Belize 2
DK - Danimarca 2
GH - Ghana 2
HR - Croazia 2
IS - Islanda 2
LK - Sri Lanka 2
NO - Norvegia 2
NP - Nepal 2
OM - Oman 2
PA - Panama 2
RO - Romania 2
XK - ???statistics.table.value.countryCode.XK??? 2
AO - Angola 1
BB - Barbados 1
BG - Bulgaria 1
BH - Bahrain 1
BS - Bahamas 1
BY - Bielorussia 1
CD - Congo 1
CI - Costa d'Avorio 1
CY - Cipro 1
EE - Estonia 1
GE - Georgia 1
GT - Guatemala 1
IR - Iran 1
KG - Kirghizistan 1
KY - Cayman, isole 1
Totale 8.088
Città #
Singapore 1.066
Santa Clara 472
Hefei 382
Hong Kong 327
San Jose 230
Ashburn 178
Beijing 155
Ho Chi Minh City 144
Lauterbourg 141
Seoul 134
Hanoi 102
Dallas 100
Los Angeles 95
Tokyo 92
Pisa 67
Cascina 60
New York 57
São Paulo 52
Rome 49
Florence 44
Lappeenranta 41
Helsinki 33
Nuremberg 32
Milan 29
Orem 26
Vienna 26
Haiphong 24
Montreal 24
Buffalo 23
London 23
Frankfurt am Main 22
Atlanta 21
Minamishinagawa 21
Warsaw 19
Bengaluru 18
Da Nang 17
Houston 17
Rio de Janeiro 17
Stockholm 17
Brooklyn 16
Council Bluffs 15
Amsterdam 14
Manchester 14
Moscow 14
Philadelphia 14
Curitiba 13
Chicago 12
Hải Dương 12
Seattle 12
Toronto 12
Brasília 11
Johannesburg 11
Kuala Lumpur 11
Phoenix 11
The Bronx 11
Campinas 10
Chennai 10
Thessaloniki 10
Baghdad 9
Belo Horizonte 9
Biên Hòa 9
Can Tho 9
Denver 9
Guarulhos 9
Nairobi 9
New Delhi 9
Venice 9
Dhaka 8
Lucca 8
Munich 8
Naples 8
Quito 8
Turku 8
Boardman 7
Boston 7
Dublin 7
Falkenstein 7
Hyderabad 7
Mexico City 7
San José 7
Tashkent 7
Asunción 6
Guayaquil 6
Istanbul 6
Jakarta 6
Kingston 6
Las Vegas 6
Livorno 6
Paris 6
Piombino 6
Piscataway 6
Pittsburgh 6
Porto Alegre 6
Bogotá 5
Bắc Ninh 5
Caxias do Sul 5
City of London 5
Cleveland 5
Düsseldorf 5
Elk Grove Village 5
Totale 4.922
Nome #
ISTI-day 2025 Proceedings 147
X-DART: blending dropout and pruning for efficient learning to rank 111
Ensemble model compression for fast and energy-efficient ranking on FPGAs 106
The impact of negative samples on learning to rank 104
ChatGPT versus modest large language models: an extensive study on benefits and drawbacks for conversational search 103
Dynamic hard pruning of neural networks at the edge of the internet 99
Speed prediction in large and dynamic traffic sensor networks 96
Rewriting conversational utterances with instructed large language models 93
Dynamic hard pruning of Neural Networks at the edge of the internet 90
PerconAI 2024: 3rd Workshop on Pervasive and Resource-Constrained Artificial Intelligence - Welcome and Committees 90
Adaptive utterance rewriting for conversational search 89
Dynamic Wi-Fi RSSI normalization in unmapped locations 84
Caching historical embeddings in conversational search 84
TSXor: a simple time series compression algorithm 83
Caching historical embeddings in conversational search 82
Quality versus efficiency in document scoring with learning-to-rank models 79
Preface ECIR 2025 78
Efficient inverted indexes for approximate retrieval over learned sparse representations 78
Improving RAG systems via sentence clustering and reordering 76
Commonsense injection in conversational systems: an adaptable framework for query expansion 75
Selective gradient boosting for effective learning to rank 75
LongDoc summarization using instruction-tuned large language models for food safety regulations 74
MUSETS: Diversity-aware web query suggestions for shortening user sessions 73
Efficient approximate nearest neighbor search on a raspberry Pi 73
Bridging dense and sparse maximum inner product search 73
Leveraging feature selection to detect potential tax fraudsters 72
Early exit strategies for approximate k-NN search in dense retrieval 70
Power- and fragmentation-aware online scheduling for GPU datacenters 70
Distilled neural networks for efficient learning to rank 70
Learning early exit strategies for additive ranking ensembles 69
Multicore/Manycore parallel traversal of large forests of regression trees 69
Topic propagation in conversational search 69
Sorting using BItonic netwoRk wIth CUDA 67
Early exit strategies for learning-to-rank cascades 67
RankEval: Evaluation and investigation of ranking models 67
Predicting and explaining privacy risk exposure in mobility data 65
RICH: Research and Innovation for Cultural Heritage 64
QuickScorer: a fast algorithm to rank documents with additive ensembles of regression trees 64
Parallel Traversal of Large Ensembles of Decision Trees 64
Weighting passages enhances accuracy 64
ISTI Young Researcher Award "Matteo Dellepiane" - Edition 2019 64
X-CLEaVER: Learning ranking ensembles by growing and pruning trees 64
An approximate algorithm for maximum inner product search over streaming sparse vectors 63
Enhanced news retrieval: passages lead the way! 62
QuickScorer: efficient traversal of large ensembles of decision trees 61
Efficient multi-vector dense retrieval with bit vectors 61
Efficient and effective query expansion for web search 61
Efficient and effective multi-vector dense retrieval with EMVB 61
RIS - Architettura del sistema RIS (Architettura Finale) 60
Analysing trajectories of mobile users: from data warehouses to recommender systems 60
kANNolo: sweet and smooth approximate k-nearest neighbors search 58
Can embeddings analysis explain large language model ranking? 58
An optimal algorithm for finding champions in tournament graphs 58
A novel approach to define the local region of dynamic selection techniques in imbalanced credit scoring problems 58
A method to rank documents by a computer, using additive ensembles of regression trees and cache optimisation, and search engines using such a method 57
Learning bivariate scoring functions for ranking 57
Perception of social phenomena through the multidimensional analysis of online social networks 57
Effective Data Access Patterns on Massively Parallel Processors 56
RecTour: a recommender system for tourists 56
RankEval: an evaluation and analysis framework for learning-to-rank solutions 56
LearNext: learning to predict tourists movements 55
Distilled neural networks for efficient learning to rank: (Extended Abstract) 55
Energy-efficient ranking on FPGAs through ensemble model compression (Abstract) 54
Pairing clustered inverted indexes with κ-NN graphs for fast approximate retrieval over learned sparse representations 54
Investigating the scalability of approximate sparse retrieval algorithms to massive datasets 53
ILMART: interpretable ranking with constrained LambdaMART 53
Improve ranking efficiency by optimizing tree ensembles 53
On learning prediction models for tourists paths 51
Improving Europeana search experience using query logs 50
Fast filtering of search results sorted by attribute 50
S-cube 50
Neural network compression using binarization and few full-precision weights 50
ProgettISTI 2016 50
PerconAI 2023: 2nd Workshop on Pervasive and Resource-Constrained Artificial Intelligence - Welcome from General Chairs 50
Learning to shorten query sessions. 50
QuickRank: A C++ suite of learning to rank algorithms 49
Fast Approximate Filtering of Search Results Sorted by Attribute 48
Report on the 13th Italian Information Retrieval Workshop (IIR 2023) 47
PeRConAI 2022: First Workshop on Pervasive and Resource-Constrained Artificial Intelligence - Welcome from General Chairs 47
ISTI young research award 2016 47
On tag spell checking 46
Explainable, effective, and efficient learning-to-rank models using ILMART 46
Speeding up document ranking with rank-based features 46
GPU-based parallelization of QuickScorer to speed-up document ranking with tree ensembles 45
Efficient traversal of decision tree ensembles with FPGAs 45
Post-Hoc selection of pareto-optimal solutions in search and recommendation 45
High-quality prediction of tourist movements using temporal trajectories in graphs 44
Effective inference-free retrieval for learned sparse representations 43
A trajectory-based recommender system for tourism. 43
Mining lifecycle event logs for enhancing service-based applications 43
ISTI Young Research Award 2017 43
ReNeuIR at SIGIR 2025: the Fourth Workshop on Reaching Efficiency in Neural Information Retrieval 42
Exploiting CPU SIMD extensions to speed-up document scoring with tree ensembles 42
Fast Ranking with Additive Ensembles of Oblivious and Non-Oblivious Regression Trees 42
Query-level early exit for additive learning-to-rank ensembles 42
Efficient and effective tree-based and neural learning to rank 41
Generating suggestions for queries in the long tail with an inverted index 41
LearNext: learning to predict tourists movements 41
Fast feature selection for learning to rank 41
SPRANKER: a discovery tool to rank service providers using quality of experience 41
Totale 6.292
Categoria #
all - tutte 27.689
article - articoli 6.783
book - libri 26
conference - conferenze 0
curatela - curatele 0
other - altro 0
patent - brevetti 0
selected - selezionate 0
volume - volumi 975
Totale 35.473


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2023/202416 0 0 0 0 0 0 0 0 5 1 7 3
2024/20252.781 26 12 210 105 349 214 150 158 228 129 662 538
2025/20265.156 324 508 446 780 736 272 745 253 302 347 209 234
2026/2027312 312 0 0 0 0 0 0 0 0 0 0 0
Totale 8.265