Общедоступные статьи - Ferdinando CicaleseПодробнее...
2 статьи недоступны нигде
RatioRF: a novel measure for random forest clustering based on the Tversky’s ratio model
M Bicego, F Cicalese, A Mensi
IEEE Transactions on Knowledge and Data Engineering 35 (1), 830-841, 2021
Финансирование: Federal Ministry of Education and Research, Germany
On the Redundancy of D-Ary Fano Codes
F Cicalese, M Rossi
SOFSEM 2021: Theory and Practice of Computer Science: 47th International …, 2021
Финансирование: US National Science Foundation
13 статей доступны в некоторых источниках
Minimum-entropy couplings and their applications
F Cicalese, L Gargano, U Vaccaro
IEEE Transactions on Information Theory 65 (6), 3436-3451, 2019
Финансирование: Federal Ministry of Education and Research, Germany
Searching with lies under error cost constraints
R Ahlswede, F Cicalese, C Deppe
Discrete applied mathematics 156 (9), 1444-1460, 2008
Финансирование: German Research Foundation
On the tree search problem with non-uniform costs
F Cicalese, B Keszegh, B Lidický, D Pálvölgyi, T Valla
Theoretical Computer Science 647, 22-32, 2016
Финансирование: US National Science Foundation, Magyar Tudományos Akadémia, Hungarian …
Two batch search with lie cost
R Ahlswede, F Cicalese, C Deppe, U Vaccaro
IEEE transactions on information theory 55 (4), 1433-1439, 2009
Финансирование: German Research Foundation
Decision trees with short explainable rules
VF Souza, F Cicalese, E Laber, M Molinaro
Advances in neural information processing systems 35, 12365-12379, 2022
Финансирование: US Department of Defense
A linear algorithm for string reconstruction in the reverse complement equivalence model
F Cicalese, PL Erdős, Z Lipták
Journal of Discrete Algorithms 14, 37-54, 2012
Финансирование: Hungarian Scientific Research Fund
A combinatorial model of two-sided search
H Aydinian, F Cicalese, C Deppe, V Lebedev
International Journal of Foundations of Computer Science 29 (04), 481-504, 2018
Финансирование: German Research Foundation
Information theoretical clustering is hard to approximate
F Cicalese, ES Laber
IEEE Transactions on Information Theory 67 (1), 586-597, 2020
Финансирование: Federal Ministry of Education and Research, Germany
On infinite prefix normal words
F Cicalese, Z Lipták, M Rossi
Theoretical computer science 859, 134-148, 2021
Финансирование: US National Science Foundation, US National Institutes of Health
Optimal strategies for a model of combinatorial two-sided search
H Aydinian, F Cicalese, C Deppe, V Lebedev
Proc. 7th Int. Workshop on Optimal Codes and Related Topics (OC’2013 …, 2013
Финансирование: German Research Foundation
Efficient reconstruction of RC-equivalent strings
F Cicalese, PL Erdős, Z Lipták
Combinatorial Algorithms: 21st International Workshop, IWOCA 2010, London …, 2011
Финансирование: Hungarian Scientific Research Fund
Decision Trees with Short Explainable Rules
S Victor, F Cicalese, L Eduardo, M Marco
ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 35, 1-15, 2022
Финансирование: US Department of Defense
On Constrained Intersection Representations of Graphs and Digraphs
F Cicalese, C Dallard, M Milanič
33rd International Symposium on Algorithms and Computation (ISAAC 2022), 38 …, 2022
Финансирование: Slovenian Research Agency, Government of Italy
Информация о публикациях и финансировании собрана автоматически.