VENTURINI, ROSSANO
 Distribuzione geografica
Continente #
AS - Asia 1.396
NA - Nord America 817
SA - Sud America 335
EU - Europa 308
AF - Africa 22
OC - Oceania 3
Continente sconosciuto - Info sul continente non disponibili 1
Totale 2.882
Nazione #
US - Stati Uniti d'America 786
SG - Singapore 631
CN - Cina 294
BR - Brasile 279
VN - Vietnam 155
HK - Hong Kong 135
IT - Italia 92
FR - Francia 70
JP - Giappone 36
IN - India 35
AR - Argentina 29
BD - Bangladesh 24
KR - Corea 24
DE - Germania 23
NL - Olanda 22
AT - Austria 19
FI - Finlandia 19
GB - Regno Unito 18
CA - Canada 14
ID - Indonesia 10
EC - Ecuador 8
CO - Colombia 7
PK - Pakistan 6
SA - Arabia Saudita 6
SE - Svezia 6
IL - Israele 5
JO - Giordania 5
MA - Marocco 5
MX - Messico 5
UA - Ucraina 5
UZ - Uzbekistan 5
ZA - Sudafrica 5
ES - Italia 4
IQ - Iraq 4
PL - Polonia 4
CL - Cile 3
CR - Costa Rica 3
DO - Repubblica Dominicana 3
EG - Egitto 3
HR - Croazia 3
IE - Irlanda 3
LT - Lituania 3
RU - Federazione Russa 3
TR - Turchia 3
VE - Venezuela 3
AU - Australia 2
AZ - Azerbaigian 2
BE - Belgio 2
BH - Bahrain 2
CZ - Repubblica Ceca 2
DK - Danimarca 2
DZ - Algeria 2
JM - Giamaica 2
NP - Nepal 2
PS - Palestinian Territory 2
PY - Paraguay 2
QA - Qatar 2
RS - Serbia 2
TN - Tunisia 2
UY - Uruguay 2
AE - Emirati Arabi Uniti 1
AL - Albania 1
BA - Bosnia-Erzegovina 1
BB - Barbados 1
BJ - Benin 1
BN - Brunei Darussalam 1
BO - Bolivia 1
CH - Svizzera 1
CI - Costa d'Avorio 1
GE - Georgia 1
GT - Guatemala 1
KE - Kenya 1
KG - Kirghizistan 1
LA - Repubblica Popolare Democratica del Laos 1
LV - Lettonia 1
MY - Malesia 1
NZ - Nuova Zelanda 1
OM - Oman 1
PA - Panama 1
PE - Perù 1
PH - Filippine 1
PT - Portogallo 1
SK - Slovacchia (Repubblica Slovacca) 1
SO - Somalia 1
TT - Trinidad e Tobago 1
XK - ???statistics.table.value.countryCode.XK??? 1
ZM - Zambia 1
Totale 2.882
Città #
Singapore 371
Santa Clara 314
Hong Kong 133
San Jose 109
Hefei 81
Beijing 64
Ho Chi Minh City 57
Lauterbourg 55
Hanoi 46
Los Angeles 44
Ashburn 37
Tokyo 31
São Paulo 27
Seoul 23
Dallas 20
New York 20
Florence 12
Orem 11
Rome 11
Vienna 11
Lappeenranta 10
Nuremberg 10
Frankfurt am Main 9
Rio de Janeiro 8
Toronto 7
Bengaluru 6
Brasília 6
Haiphong 6
London 6
Belo Horizonte 5
Buffalo 5
Cascina 5
Curitiba 5
Helsinki 5
Pisa 5
Tashkent 5
Amman 4
Amsterdam 4
Brooklyn 4
Campinas 4
Chennai 4
Da Nang 4
Guarulhos 4
Hải Dương 4
Johannesburg 4
Maceió 4
Miami 4
Milan 4
Minamishinagawa 4
Phoenix 4
Stockholm 4
São José dos Campos 4
Turku 4
Warsaw 4
Atlanta 3
Fortaleza 3
Ha Long 3
Houston 3
Las Vegas 3
Mumbai 3
Paris 3
Philadelphia 3
Quito 3
Ribeirão Preto 3
Salvador 3
San Francisco 3
Santo André 3
Volta Redonda 3
Zagreb 3
Aparecida de Goiânia 2
Atibaia 2
Baku 2
Bogliasco 2
Bologna 2
Brussels 2
Cairo 2
Campo Grande 2
Can Tho 2
Carapicuíba 2
Chandigarh 2
Charlotte 2
Chicago 2
Colombo 2
Council Bluffs 2
Dhaka 2
Doha 2
Duque de Caxias 2
Düsseldorf 2
Elk Grove Village 2
Fernandópolis 2
Hyderabad 2
Jeddah 2
Juiz de Fora 2
Jundiaí 2
Karachi 2
Kingston 2
Lancaster 2
Las Flores 2
Limerick 2
Lomas de Zamora 2
Totale 1.759
Nome #
TSXor: a simple time series compression algorithm 80
Componente per la creazione di suggerimenti da comportamenti collettivi 70
Dynamic Elias-Fano Representation 69
Multicore/Manycore parallel traversal of large forests of regression trees 67
Handling massive n-gram datasets efficiently 67
QuickScorer: a fast algorithm to rank documents with additive ensembles of regression trees 63
Distilled neural networks for efficient learning to rank 63
Parallel Traversal of Large Ensembles of Decision Trees 62
Compressed indexes for fast search of semantic data 59
Efficient multi-vector dense retrieval with bit vectors 59
QuickScorer: efficient traversal of large ensembles of decision trees 58
Efficient and effective query expansion for web search 58
Efficient and effective multi-vector dense retrieval with EMVB 58
kANNolo: sweet and smooth approximate k-nearest neighbors search 56
A method to rank documents by a computer, using additive ensembles of regression trees and cache optimisation, and search engines using such a method 54
Learning bivariate scoring functions for ranking 53
On optimally partitioning variable-byte codes 52
Web search 51
Pairing clustered inverted indexes with κ-NN graphs for fast approximate retrieval over learned sparse representations 51
An encoding for order-preserving matching 50
POR FESR 2007-2013 VISITO Tuscany project: VIsual Support to Interactive TOurism in Tuscany 50
VISITO - Componenti per l'estrazione delle features dalle immagini 49
VSEncoding: efficient coding and fast decoding of integer lists via dynamic programming 49
Fast filtering of search results sorted by attribute 48
Efficient and effective query auto-completion 48
VISITO Tuscany - Rapporto con la specifica dettagliata delle funzionalità della piattaforma VISITO Tuscany 46
On the bit-complexity of Lempel-Ziv compression 46
VSEncoding: efficient coding and fast decoding of integer lists via dynamic programming 45
Inverted Index Compression 45
Clustered Elias-Fano Indexes 45
Fast Approximate Filtering of Search Results Sorted by Attribute 44
How random walks can help tourism 43
The compressed permuterm index 43
Compressed indexes for fast search of semantic data 43
VISITO Tuscany - Progetto dell'architettura della piattaforma VISITO Tuscany 43
On optimally partitioning a text to improve its compression 42
Exploiting CPU SIMD extensions to speed-up document scoring with tree ensembles 41
Distribution-aware compressed full-text indexes 40
Recommender systems 40
VISITO Tuscany - Progetto dell'architettura della piattaforma VISITO Tuscany v1 39
Efficient Query Recommendations in the Long Tail via Center-Piece Subgraphs 39
Compressed String Dictionary Look-up with Edit Distance One 38
Compressed String Dictionary Search with Edit Distance One 37
Compressed static functions with applications 37
A1.1.1 Lo stato dell'arte: tecnologia ed utenti 36
Succinct data structures in information retrieval: Theory and practice 34
Bicriteria data compression: efficient and usable 34
Compressed data structures for strings. On searching and extracting strings from compressed textual data 34
On compact representations of all-pairs-shortest-path-distance matrices 34
Bicriteria data compression 33
Cache-oblivious peeling of random hypergraphs 33
Fast and compact hamming distance index 33
Compressed cache-oblivious string B-tree 33
Efficient Data Structures for Massive N-Gram Datasets 32
Dynamic compressed strings with random access 31
Space-Efficient Substring Occurrence Estimation 31
Compressed Cache-Oblivious String B-Tree 30
Partitioned Elias-Fano indexes 29
Optimal space-time tradeoffs for inverted indexes 28
Distribution-aware compressed full-text indexes 28
Cache-oblivious peeling of random hypergraphs 28
VISITO - Sviluppo del componente per l'indicizzazione dei dati 27
On optimally partitioning a text to improve its compression 25
Recommendations for the long tail by Term-Query Graph 25
Space-efficient substring occurrence estimation 23
On the bit-complexity of Lempel-Ziv compression 22
Totale 2.903
Categoria #
all - tutte 10.065
article - articoli 2.608
book - libri 116
conference - conferenze 0
curatela - curatele 0
other - altro 0
patent - brevetti 0
selected - selezionate 0
volume - volumi 422
Totale 13.211


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2023/202426 0 0 0 0 0 0 0 0 0 0 24 2
2024/20251.187 5 3 75 34 245 95 43 46 77 56 299 209
2025/20261.690 101 112 141 234 271 83 306 88 114 123 117 0
Totale 2.903