CATALOGO DEI PRODOTTI DELLA RICERCA

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


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2020/2021229 0 0 0 0 0 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/20262.998 317 278 296 737 1.142 228 0 0 0 0 0 0
Totale 8.509