CATALOGO DEI PRODOTTI DELLA RICERCA

CICALESE, Ferdinando
 Distribuzione geografica
Salva come PNG Salva come JPEG
Continente #
NA - Nord America 2.281
EU - Europa 1.839
AS - Asia 1.738
SA - Sud America 207
AF - Africa 29
Continente sconosciuto - Info sul continente non disponibili 7
OC - Oceania 5
Totale 6.106
Salva come PNG Salva come JPEG
Nazione #
US - Stati Uniti d'America 2.257
SG - Singapore 734
GB - Regno Unito 616
CN - Cina 539
HK - Hong Kong 243
IT - Italia 199
BR - Brasile 191
FR - Francia 191
RU - Federazione Russa 183
IE - Irlanda 160
FI - Finlandia 131
SE - Svezia 130
DE - Germania 118
KR - Corea 106
UA - Ucraina 37
TR - Turchia 27
IN - India 19
AT - Austria 18
VN - Vietnam 18
NL - Olanda 16
BE - Belgio 12
CA - Canada 12
JP - Giappone 9
BD - Bangladesh 8
TG - Togo 8
EU - Europa 7
PL - Polonia 7
ES - Italia 6
ZA - Sudafrica 6
EC - Ecuador 5
ID - Indonesia 5
MA - Marocco 5
MX - Messico 5
AU - Australia 4
CL - Cile 4
EG - Egitto 4
UZ - Uzbekistan 4
AE - Emirati Arabi Uniti 3
IQ - Iraq 3
RS - Serbia 3
AR - Argentina 2
BB - Barbados 2
HR - Croazia 2
KG - Kirghizistan 2
KZ - Kazakistan 2
LV - Lettonia 2
PA - Panama 2
PS - Palestinian Territory 2
PT - Portogallo 2
RO - Romania 2
TW - Taiwan 2
VE - Venezuela 2
AO - Angola 1
BH - Bahrain 1
BN - Brunei Darussalam 1
BO - Bolivia 1
CM - Camerun 1
CO - Colombia 1
CR - Costa Rica 1
CY - Cipro 1
CZ - Repubblica Ceca 1
ET - Etiopia 1
GA - Gabon 1
GE - Georgia 1
GR - Grecia 1
GT - Guatemala 1
IL - Israele 1
IR - Iran 1
JM - Giamaica 1
KE - Kenya 1
LA - Repubblica Popolare Democratica del Laos 1
LB - Libano 1
LK - Sri Lanka 1
LT - Lituania 1
ME - Montenegro 1
MY - Malesia 1
NZ - Nuova Zelanda 1
PK - Pakistan 1
TH - Thailandia 1
TN - Tunisia 1
UY - Uruguay 1
Totale 6.106
Salva come PNG Salva come JPEG
Città #
Southend 549
Singapore 357
Chandler 245
Dallas 243
Hong Kong 236
Ann Arbor 230
Jacksonville 219
Woodbridge 187
Dublin 161
Houston 161
Beijing 114
Ashburn 90
Verona 81
Wilmington 76
Lawrence 70
Princeton 70
The Dalles 70
Seoul 68
Nanjing 47
Helsinki 44
Jinan 35
New York 33
Shenyang 31
Columbus 25
Milan 25
Nanchang 22
Council Bluffs 20
Changsha 18
Haikou 17
Santa Clara 16
Vienna 16
Ningbo 15
Sindelfingen 15
Frankfurt am Main 14
North Bergen 14
São Paulo 14
Brooklyn 13
Jiaxing 13
Los Angeles 13
Moscow 13
Brussels 12
Tianjin 12
Seattle 11
Guangzhou 10
Norwalk 10
Hebei 9
Lanzhou 9
Zhengzhou 9
Amsterdam 8
Chennai 8
Lomé 8
Redwood City 8
Chicago 7
Hangzhou 7
Istanbul 7
Taizhou 7
Atlanta 6
Boardman 6
Brescia 6
Hanoi 6
Palermo 6
San Francisco 6
Taiyuan 6
Tappahannock 6
Warsaw 6
Belo Horizonte 5
Boston 5
Lappeenranta 5
Shanghai 5
Stockholm 5
Ankara 4
Brasília 4
Coimbatore 4
Düsseldorf 4
Fortaleza 4
Guayaquil 4
Ho Chi Minh City 4
Johannesburg 4
London 4
Mantova 4
Romola 4
Tashkent 4
Tokyo 4
Augusta 3
Campinas 3
Curitiba 3
Falls Church 3
Florence 3
Fuzhou 3
Goiânia 3
Guarulhos 3
Jackson 3
Nuremberg 3
Praia Grande 3
Santo André 3
Toronto 3
Volta Redonda 3
Washington 3
Belgrade 2
Bexley 2
Totale 4.022
Salva come PNG Salva come JPEG
Nome #
Q-ary Ulam-Rényi game with constrained lies 155
Efficient Reconstruction of RC-Equivalent Strings 146
Indexes for Jumbled Pattern Matching in Strings, Trees, and Graphs 134
Bubble-Flip---A New Generation Algorithm for Prefix Normal Words 124
Hardness, Approximability, and Exact Algorithms for Vector Domination and Total Vector Domination in Graphs 120
On the Competitive Ratio of Evaluating Priced Functions 118
Bubble-Flip---A New Generation Algorithm for Prefix Normal Words 117
Searching for Jumbled Patterns in Strings 107
On Approximate Jumbled Pattern Matching in Strings. 107
Information Theoretic Measures of Distances and their Econometric Applications 106
Guest Editorial for "Group Testing: models and applications" 106
A Combinatorial Model of Two-Sided Search 105
Algorithms for Jumbled Pattern Matching in Strings 104
The Binary Identification Problems for Weighted Trees 98
Q-ary Ulam-Renyi game with constrained lies 97
Competitive Evaluation of Threshold Functions in the Priced Information Model 94
Combinatorial pattern matching: 26th annual symposium, CPM 2015 Ischia Island, Italy, june 29 – july 1, 2015 proceedings 94
On the multi-interval Ulam-Rényi game: For 3 lies 4 intervals suffice 94
The Multi-interval Ulam-Rényi Game 93
Binary Identification Problems for Weighted Trees 93
Trading off Worst and Expected Cost in Decision Tree Problems 92
Bubble-Flip—A new generation algorithm for prefix normal words 92
On Table Arrangements, Scrabble Freaks, and Jumbled Pattern Matching 90
Least adaptive optimal search with unreliable tests 89
Near Linear Time Construction of an Approximate Index for All Maximum Consecutive Sub-sums of a Sequence 88
The #DNN-Verification Problem: Counting Unsafe Inputs for Deep Neural Networks 86
Competitive Boolean Function Evaluation. Beyond Monotonicity and the Symmetric Case 85
Approximating decision trees with value dependent testing costs 84
H(X) vs. H(f (X)) 83
Fault-Tolerant Search Algorithms 82
Approximating probability distributions with short vectors, via information theoretic distance measures 82
RatioRF: a novel measure for Random Forest clustering based on the Tversky's Ratio model 82
Diagnosis determination: decision trees optimizing simultaneously worst and expected testing cost 81
Graphs of Separability at Most Two: Structural Characterizations and Their Consequences 80
On Greedy Algorithms for Decision Trees 80
Decision Trees for Function Evaluation: Simultaneous Optimization of Worst and Expected Cost 79
On Infinite Prefix Normal Words 79
Superselectors: Efficient Constructions and Applications 76
Correction to: Trading Off Worst and Expected Cost in Decision Tree Problems 74
Approximating the maximum consecutive subsums of a sequence 73
Latency-bounded target set selection in social networks 72
Recent developments of feedback coding, and its relations with many-valued logic 72
Graphs of separability at most two 70
A Combinatorial Model of Two-Sided Search 70
How to go Viral: Cheaply and Quickly 64
Latency-Bounded Target Set Selection in Social Networks 64
On the complexity of searching in trees and partially ordered structures 63
On the Tree Search Problem with Non-uniform Costs 63
Hardness of MSA with Selective Column Scoring 62
Using Random Forest Distances for Outlier Detection 61
Bounds on the Entropy of a Function of a Random Variable and their Applications 61
On lower bounds for the Maximum Consecutive Subsums Problem and the (min, +)-convolution 60
Trading Off Worst and Expected Cost in Decision Tree Problems 60
On D-ary Fano Codes 59
Perfect Strategies for the Ulam-Rényi Game with Multi-interval Questions 59
Function Evaluation: decision trees optimizing simultaneously worst and expected testing cost 59
Spread of influence in weighted networks under time and budget constraints 57
Improved Approximation Algorithms for the Average-Case Tree Searching Problem 57
On the tree search problem with non-uniform costs 56
Maximum Entropy Interval Aggregations 56
Distance-Based Random Forest Clustering with~Missing Data 55
On the multi-interval Ulam-Rényi game: For 3 lies 4 intervals suffice 54
On the complexity of the vector connectivity problem 53
How to find a joint probability distribution of minimum entropy (almost) given the marginals 53
Teaching with limited information on the Learner's behaviour 52
New results on information theoretic clustering 52
On the Complexity of Directed Intersection Representation of {DAGs} 52
Decision Trees with Short Explainable Rules 51
A Note on Approximation of Uniform Distributions from Variable-to-Fixed Length Codes 51
A Better Bouncer's Algorithm 51
On the approximability and exact algorithms for vector domination and related problems in graphs 49
On the Redundancy of D-Ary Fano Codes 47
On the Complexity of Searching in Trees: Average-Case Minimization 46
On the star decomposition of a graph: Hardness results and approximation for the max{\textendash}min optimization problem 46
Enumerating Safe Regions in Deep Neural Networks with Provable Probabilistic Guarantees 45
Hardness and approximation of multiple sequence alignment with column score 43
On infinite prefix normal words 43
Information Theoretical Clustering Is Hard to Approximate 41
Computing Random Forest-distances in the presence of missing data 38
Faster Deterministic Communication in Radio Networks 38
Minimum-Entropy Couplings and Their Applications 38
On the Good Behaviour of Extremely Randomized Trees in Random Forest-Distance Computation 36
The Tandem Duplication Distance Problem Is Hard over Bounded Alphabets 36
Optimal Approximation of Uniform Distributions with a Biased Coin 34
An Interesting Property of Random Forest Distances with Respect to the Curse of Dimensionality 26
Totale 6.244
Salva come PNG Salva come JPEG
Categoria #
all - tutte 26.437
article - articoli 11.449
book - libri 306
conference - conferenze 13.282
curatela - curatele 342
other - altro 363
patent - brevetti 0
selected - selezionate 0
volume - volumi 695
Totale 52.874
Salva come PNG Salva come JPEG


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2020/2021397 0 0 33 59 76 101 10 15 29 6 52 16
2021/2022371 19 44 26 11 36 10 6 34 14 14 42 115
2022/2023882 79 55 125 138 59 227 4 54 102 6 23 10
2023/2024494 21 46 38 35 56 48 25 40 11 83 56 35
2024/20251.610 91 89 78 238 59 44 65 107 223 124 164 328
2025/2026733 317 278 138 0 0 0 0 0 0 0 0 0
Totale 6.244