A Novel Block-based Watermarking Scheme Using the SVD Transform (2009)
Alessandro Basso, Francesco Bergadano, Davide Cavagnino, Victor Pomponiu, Annamaria Vernone
In this paper, a block-based watermarking scheme based on the Singular Value Decomposition (SVD) is proposed. Our watermark, a pseudo-random Gaussian sequence, is embedded by modifying the angles...
Amos Beimel, Francesco Bergadano, Nader H. Bshouty, Stefano Varricchio
Abstract. We study the learnability of multiplicity automata in Angluin’s exact learning model, and we investigate its applications. Our starting point is a known theorem from automata theory...
Amos Beimel, Francesco Bergadano, Nader H. Bshouty
1 Introduction We study the learnability of multiplicity automata in Angluin's exact learning model, and we investigate its applications. Our starting point is a known theorem from automata...
A GENERAL CRITERION FOR MEASURING (2007)
F. Bergadano, S. Matwin, R. S. Michalski, J. Zhang, Francesco Bergadano, Stan Matwin, ...
An important aspect of any learning method is an evaluation of the learned knowledge, in particular, an evaluation of the plausibility and usefulness of concept descriptions that are being created....
Laboratoire de Recherche en Informatique, Inference and Learning Group, (2007)
Francesco Bergadano, Birgit Tausend, Fakultat Informatik
Abstract. Interest in Declarative bias in Machine Learning is growing with the expressivity of the concept description language of ML systems. Inductive Logic Programming more than any other ML field...
Secure Logging for Irrefutable Administration Abstract (2005)
Francesco Bergadano, Davide Cavagnino, Paolo Dal Checco, Pasquale Andrea Nesta, Michele Miraglia, Pier Luigi Zaccone
This paper presents a method that allows for securely saving a temporal sequence of data (log lines) in a file. Log lines are signed by an authority, and are thus unalterable without detection. Data...
Lightweight security for internet polls (2004)
Ro Basso, Francesco Bergadano, Ilaria Coradazzi, Paolo Dal Checco
Abstract. Is it possible to implement practical Internet Polls that fulfill even the weakest security requirements? The technology available today would lead to a negative answer, because of the...
Learning Functions Represented as Multiplicity Automata (2000)
Amos Beimel, Francesco Bergadano, Nader H. Bshouty, Eyal Kushilevitz, Stefano Varricchio
We study the learnability of multiplicity automata in Angluin's exact learning model, and we investigate its applications. Our starting point is a known theorem from automata theory relating the...
A New Family of Authentication Protocols (1998)
Ross Anderson Francesco, Francesco Bergadano, Bruno Crispo, Jong-hyeon Lee, Charalampos Manifavas, Roger Needham
. We present a related family of authentication and digital signature protocols based on symmetric cryptographic primitives which perform substantially better than previous constructions. Previously,...
A New Family of Authentication Protocols (1998)
Ross Anderson Francesco, Francesco Bergadano, Bruno Crispo, Jong-hyeon Lee, Charalampos Manifavas, Roger Needham
. We present a related family of authentication and digital signature protocols based on symmetric cryptographic primitives which perform substantially better than previous constructions. Previously,...
A New Family of Authentication Protocols (1998)
Ross Anderson, Francesco Bergadano, Bruno Crispo, Jong-Hyeon Lee, Charalampos Manifavas, Roger Needham
We present a related family of authentication and digital signature protocols based on symmetric cryptographic primitives which perform substantially better than previous constructions. Previously,...
On learning branching programs and small depth circuits (1997)
Francesco Bergadano, Nader H. Bshouty, Christino Tamon, Stefano Varricchio
This paper studies the learnability of branching programs and small depth circuits with modular and threshold gates in both the exact and PAC learning models with and without membership queries. Some...
On Learning Branching Programs and Small Depth Circuits (1997)
Francesco Bergadano, Nader H. Bshouty, Christino Tamon, Stefano Varricchio
This paper studies the learnability of branching programs and small depth circuits with modular and threshold gates in both the exact and PAC learning models with and without membership queries. Some...
On Learning Branching Programs and Small Depth Circuits (1997)
Francesco Bergadano, Nader H. Bshouty, Christino Tamon, Stefano Varricchio
This paper studies the learnability of branching programs and small depth circuits with modular and threshold gates in both the exact and PAC learning models with and without membership queries. Some...
Learning Functions Represented as Multiplicity Automata (1997)
Amos Beimel, Francesco Bergadano, Nader H. Bshouty, Eyal Kushilevitz, Stefano Varricchio
The learnability of multiplicity automata, in Angluin's exact learning model, was proven in [12, 13, 40]. In this paper we further study the learnability of multiplicity automata. Our starting...
On the Applications of Multiplicity Automata in Learning (1996)
Amos Beimel, Francesco Bergadano, Nader H. Bshouty, Eyal Kushilevitz, Stefano Varricchio
Recently the learnability of multiplicity automata [8, 24] attracted a lot of attention, mainly because of its implications on the learnability of several classes of DNF formulae [7]. In this paper...
The difficulties of learning logic programs with cut (1993)
Francesco Bergadano, Daniele Gunetti, Umberto Trinchero
As real logic programmers normally use cut (!), an effective learning procedure for logic programs should be able to deal with it. Because the cut predicate has only a procedural meaning, clauses...
The di culties of learning logic programs with cut (1993)
Francesco Bergadano, Daniele Gunetti, Umberto Trinchero
As real logic programmers normally use cut (!), an e ective learning procedure for logic programs should be able to deal with it. Because the cut predicate has only a procedural meaning, clauses...
Learning Two-tiered Descriptions of Flexible Concepts: The POSEIDON System (1991)
Bergadano, Francesco, Matwin, Stan, Michalski, Ryszard S., Zhang, Jianping
Learning Two-Tiered Descriptions of Flexible Concepts: The POSEIDON System (1990)
Bergadano, Francesco, Matwin, Stan, Michalski, Ryszard S., Zhang, Jianping
Learning Flexible Concepts Through a Search for Simpler but Still Accurate Descriptions (1989)
Bergadano, Francesco, Matwin, Stan, Zhang, Jianping, Michalski, Ryszard S.
A General Criterion for Measuring Quality of Concept Descriptions (1988)
Bergadano, Francesco, Matwin, Stan, Michalski, Ryszard S., Zhang, Jianping