Alberto Bertoni

Theor. Comput. Sci., 2016

2015

UNIPred: Unbalance-Aware Network Integration and Prediction of Protein Functions.

[BibT_eX]

[DOI]

Marco Frasca

J. Comput. Biol., 2015

Exact Algorithms for 2-Clustering with Size Constraints in the Euclidean Plane.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM 2015: Theory and Practice of Computer Science, 2015

2014

On the Decidability of the Intersection Problem for Quantum Automata and Context-Free Languages.

[BibT_eX]

[DOI]

Flavio D'Alessandro

Int. J. Found. Comput. Sci., 2014

Size-constrained 2-clustering in the plane with Manhattan distance.

[BibT_eX]

[DOI]

Linda Pini

Proceedings of the 15th Italian Conference on Theoretical Computer Science, 2014

2013

A neural network algorithm for semi-supervised node label learning from unbalanced data.

[BibT_eX]

[DOI]

Neural Networks, 2013

Quantum Finite Automata and Linear Context-Free Languages: A Decidable Problem.

[BibT_eX]

[DOI]

Flavio D'Alessandro

Proceedings of the Developments in Language Theory - 17th International Conference, 2013

2012

Regularity of languages defined by formal series with isolated cut point.

[BibT_eX]

[DOI]

Maria Paola Bianchi

Flavio D'Alessandro

RAIRO Theor. Informatics Appl., 2012

Size Constrained Distance Clustering: Separation Properties and Some Complexity Results.

[BibT_eX]

[DOI]

Francesco Saccà

Fundam. Informaticae, 2012

A Neural Procedure for Gene Function Prediction.

[BibT_eX]

[DOI]

Marco Frasca

Andrea Sion

Proceedings of the Neural Nets and Surroundings - 22nd Italian Workshop on Neural Nets, 2012

2011

A Mathematical Model for the Validation of Gene Selection Methods.

[BibT_eX]

[DOI]

IEEE ACM Trans. Comput. Biol. Bioinform., 2011

The Inclusion Problem of Context-Free Languages: Some Tractable Cases.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2011

Identification of promoter regions in genomic sequences by 1-dimensional constraint clustering.

[BibT_eX]

[DOI]

Proceedings of the Neural Nets WIRN11, 2011

COSNet: A Cost Sensitive Neural Network for Semi-supervised Learning in Graphs.

[BibT_eX]

[DOI]

Marco Frasca

Proceedings of the Machine Learning and Knowledge Discovery in Databases, 2011

2010

Trace monoids with idempotent generators and measure-only quantum automata.

[BibT_eX]

[DOI]

Nat. Comput., 2010

Grammatical compression: compressed equivalence and other problems.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2010

Learning functional linkage networks with a cost-sensitive approach.

[BibT_eX]

[DOI]

Proceedings of the Neural Nets WIRN10, 2010

2009

The Complexity of Unary Tiling Recognizable Picture Languages: Nondeterministic and Unambiguous Cases.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2009

2008

Approximating the Mean Speedup in Trace Monoids.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2008

Discovering multi-level structures in bio-molecular data through the Bernstein inequality.

[BibT_eX]

[DOI]

BMC Bioinform., 2008

Classification of DNA microarray data with Random Projection Ensembles of Polynomial SVMs.

[BibT_eX]

[DOI]

Raffaella Folgieri

Proceedings of the New Directions in Neural Networks, 2008

Random projections preserving the Hamming distance between words.

[BibT_eX]

[DOI]

Stefano Arca

Giuseppe Lipori

Proceedings of the New Directions in Neural Networks, 2008

Literal Shuffle of Compressed Words.

[BibT_eX]

[DOI]

Proceedings of the Fifth IFIP International Conference On Theoretical Computer Science, 2008

Unsupervised Stability-Based Ensembles to Discover Reliable Structures in Complex Bio-molecular Data.

[BibT_eX]

[DOI]

Proceedings of the Computational Intelligence Methods for Bioinformatics and Biostatistics, 2008

2007

Model order selection for bio-molecular data clustering.

[BibT_eX]

[DOI]

BMC Bioinform., 2007

On the Complexity of Unary Tiling-Recognizable Picture Languages.

[BibT_eX]

[DOI]

Proceedings of the STACS 2007, 2007

Discovering Significant Structures in Clustered Bio-molecular Data Through the Bernstein Inequality.

[BibT_eX]

[DOI]

Proceedings of the Knowledge-Based Intelligent Information and Engineering Systems, 2007

Approximability and Non-approximability Results in Computing the Mean Speedup of Trace Monoids.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory, 11th International Conference, 2007

2006

Some formal tools for analyzing quantum automata.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2006

Preface.

[BibT_eX]

[DOI]

Zoltán Ésik

Juhani Karhumäki

Theor. Comput. Sci., 2006

Local Limit Properties for Pattern Statistics and Rational Models.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2006

Randomized maps for assessing the reliability of patients clusters in DNA microarray data analyses.

[BibT_eX]

[DOI]

Artif. Intell. Medicine, 2006

Context-Free Grammars and XML Languages.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory, 10th International Conference, 2006

2005

Small size quantum automata recognizing some regular languages.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2005

Bio-molecular cancer prediction with random subspace ensembles of support vector machines.

[BibT_eX]

[DOI]

Raffaella Folgieri

Neurocomputing, 2005

Ensembles Based on Random Projections to Improve the Accuracy of Clustering Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Neural Nets, 16th Italian Workshop on Neural Nets, 2005

Analysis of a Genetic Model with Finite Populations.

[BibT_eX]

[DOI]

Roberto Posenato

Proceedings of the Advances in Natural Computation, First International Conference, 2005

Some formal methods for analyzing quantum automata.

[BibT_eX]

Proceedings of the 7th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2005, Como, Italy, June 30, 2005

2004

Feature Selection Combined with Random Subspace Ensemble for Gene Expression Based Diagnosis of Malignancies.

[BibT_eX]

[DOI]

Raffaella Folgieri

Proceedings of the Biological and Artificial Intelligence Environments, 2004

Local Limit Distributions in Pattern Statistics: Beyond the Markovian Models.

[BibT_eX]

[DOI]

Proceedings of the STACS 2004, 2004

2003

On the number of occurrences of a symbol in words of regular languages.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2003

Monte Carlo simulation of quantum electron transport based on Wigner paths.

[BibT_eX]

[DOI]

Math. Comput. Simul., 2003

Golomb Rulers And Difference Sets For Succinct Quantum Automata.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2003

Lower Bounds on the Size of Quantum Automata Accepting Unary Languages.

[BibT_eX]

[DOI]

Proceedings of the Theoretical Computer Science, 8th Italian Conference, 2003

Quantum Computing: 1-Way Quantum Automata.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory, 7th International Conference, 2003

2002

A Neural Algorithm for the Maximum Clique Problem: Analysis, Experiments, and Circuit Implementation.

[BibT_eX]

[DOI]

Algorithmica, 2002

Structural Complexity and Neural Networks.

[BibT_eX]

[DOI]

Proceedings of the Neural Nets, 13th Italian Workshop on Neural Nets, 2002

2001

Dynamical Equation and Monte Carlo Simulation of the Two-time Wigner Function for Electron Quantum Transport.

[BibT_eX]

[DOI]

VLSI Design, 2001

Wigner Paths Method in Quantum Transport with Dissipation.

[BibT_eX]

[DOI]

VLSI Design, 2001

Numerical Simulation of Quantum Logic Gates Based on Quantum Wires.

[BibT_eX]

[DOI]

VLSI Design, 2001

Analogies and differences between quantum and stochastic automata.

[BibT_eX]

[DOI]

Marco Carpentieri

Theor. Comput. Sci., 2001

Random Generation for Finitely Ambiguous Context-free Languages.

[BibT_eX]

[DOI]

Massimo Santini

RAIRO Theor. Informatics Appl., 2001

Regular Languages Accepted by Quantum Automata.

[BibT_eX]

[DOI]

Marco Carpentieri

Inf. Comput., 2001

An approximation algorithm for the maximum cut problem and its experimental analysis.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2001

Solving Min Vertex Cover with Iterated Hopfield Networks.

[BibT_eX]

[DOI]

Proceedings of the 12th Italian Workshop on Neural Nets, 2001

The Prospect for Answer Sets Computation by a Genetic Model.

[BibT_eX]

[DOI]

Proceedings of the Answer Set Programming, 2001

2000

A Genetic Model: Analysis and Application to MAXSAT.

[BibT_eX]

[DOI]

Evol. Comput., 2000

Random Generation and Approximate Counting of Ambiguously Described Combinatorial Structures.

[BibT_eX]

[DOI]

Massimo Santini

Proceedings of the STACS 2000, 2000

1998

On the Inclusion Problem for Finitely Ambiguous Rational Trace Languages.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 1998

1997

A Neural Algorithm for MAX-2SAT: Performance Analysis and Circuit Implementation.

[BibT_eX]

[DOI]

Maria Alberta Alberti

Neural Networks, 1997

Approximability of the Ground State Problem for Certain Ising Spin Glasses.

[BibT_eX]

[DOI]

J. Complex., 1997

An Upper Bound for the Maximum Cut Mean Value.

[BibT_eX]

[DOI]

Roberto Posenato

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1997

A Discrete Neural Algorithm for the Maximum Clique Problem: Analysis and Circuit Implementation.

[BibT_eX]

Proceedings of the Workshop on Algorithm Engineering, 1997

Analysis of a Genetic Model.

[BibT_eX]

Proceedings of the 7th International Conference on Genetic Algorithms, 1997

A Boosting Algorithm for Regression.

[BibT_eX]

[DOI]

M. Parodi

Proceedings of the Artificial Neural Networks, 1997

1996

A Genetic Model and the Hopfield Networks.

[BibT_eX]

[DOI]

Proceedings of the Artificial Neural Networks, 1996

1995

Efficient Learning with Equivalence Queries of Conjunctions of Modulo Functions.

[BibT_eX]

[DOI]

Nicolò Cesa-Bianchi

Guido Fiorino

Inf. Process. Lett., 1995

A neural circuit for the maximum 2-satisfiability problem.

[BibT_eX]

[DOI]

Maria Alberta Alberti

Proceedings of the 3rd Euromicro Workshop on Parallel and Distributed Processing (PDP '95), 1995

Strong Optimal Lower Bounds for Turing Machines that Accept Nonregular Languages.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1995, 1995

Counting Techniques for Inclusion, Equivalence and Membership Problems.

[BibT_eX]

[DOI]

Proceedings of the Book of Traces, 1995

1994

Corrigendum: An Optimal Lower Bound for Nonregular Languages.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1994

An Optimal Lower Bound for Nonregular Languages.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1994

A Parallel Algorithm for the Hadamard Product of Holonomic Formal Series.

[BibT_eX]

[DOI]

Int. J. Algebra Comput., 1994

On Languages Accepted with Simultaneous Complexity Bounds and Their Ranking Problem.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1994, 1994

1993

On Ranking 1-Way Finitely Ambiguous NL Languages and #P<sub>1</sub>-Complete Census Functions.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 1993

Implicit Parallelism in Genetic Algorithms.

[BibT_eX]

[DOI]

Marco Dorigo

Artif. Intell., 1993

1992

Holonomic Generating Functions and Context Free Languages.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 1992

Polynomial Iniform Convergence and Polynomial-Sample Learnability.

[BibT_eX]

[DOI]

Proceedings of the Fifth Annual ACM Conference on Computational Learning Theory, 1992

1991

The Complexity of Computing the Number of Strings of Given Length in Context-Free Languages.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1991

Ranking and Formal Power Series.

[BibT_eX]

[DOI]

Danilo Bruschi

Theor. Comput. Sci., 1991

Some Notes on Computational Learing Theory.

[BibT_eX]

Bull. EATCS, 1991

Asymmetric Boltzmann machines.

[BibT_eX]

[DOI]

Biol. Cybern., 1991

Polynomial Uniform Convergence of Relative Frequencies to Probabilities.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 4, 1991

1990

Counting Problems and Algebraic Formal Power Series in Noncommuting Variables.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1990

1989

Membership Problems for Regular and Context-Free Trace Languages

[BibT_eX]

[DOI]

Inf. Comput., August, 1989

Generalized Boolean Hierarchies and Boolean Hierarchies Over RP (Conference Abstract).

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory, 1989

1988

Generating functions of trace languages.

[BibT_eX]

Bull. EATCS, 1988

1987

Computing the Counting Function of Context-Free Languages.

[BibT_eX]

[DOI]

Proceedings of the STACS 87, 1987

On the Prefixes of a Random Trace and the Membership Problem for Context-Free Trace Languages.

[BibT_eX]

[DOI]

Proceedings of the Applied Algebra, 1987

1986

Parallel Algorithms and the Classification of Problems.

[BibT_eX]

[DOI]

Proceedings of the WOPPLOT 86, 1986

Analysis of a Class of Algorithms for Problems on Trace Languages.

[BibT_eX]

[DOI]

Proceedings of the Applied Algebra, 1986

1984

Abstract Data Types and Their Extensions within a Constructive Logic.

[BibT_eX]

[DOI]

Proceedings of the Semantics of Data Types, International Symposium, 1984

1982

Equivalence and Membership Problems for Regular Trace Languages.

[BibT_eX]

[DOI]

Proceedings of the Automata, 1982

1981

On Efficient Computation of the Coefficients of Some Polynomials with Applications to Some Enumeration Problems.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1981

A Characterization of the Class of Functions Computable in Polynomial Time on Random Access Machines

[BibT_eX]

[DOI]

Proceedings of the 13th Annual ACM Symposium on Theory of Computing, 1981

An Application of the Theory of Free Partially Commutative Monoids: Asymptotic Densities of Trace Languages.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1981, Strbske Pleso, Czechoslovakia, August 31, 1981

1980

Towards a Theory of Abstract Data Types: A Discussion on Problems and Tools.

[BibT_eX]

[DOI]

Pierangelo Miglioli

Proceedings of the International Symposium on Programming, 1980

1979

Three Efficient Algorithms for Counting Problems.

[BibT_eX]

[DOI]

Mauro Torelli

Inf. Process. Lett., 1979

A Characterization of Abstract Data as Model-Theoretic Invariants.

[BibT_eX]

[DOI]

Pierangelo Miglioli

Proceedings of the Automata, 1979

1977

An Algebraic Approach to Problem Solution and Problem Semantics.

[BibT_eX]

[DOI]

Mauro Torelli

Proceedings of the Mathematical Foundations of Computer Science 1977, 1977

Some Recursive Unsolvable Problems Relating to Isolated Cutpoints in Probabilistic Automata.

[BibT_eX]

[DOI]

Mauro Torelli

Proceedings of the Automata, 1977

1974

Mathematical Methods of the Theory of Stochastic Automata.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science, 1974

The Solution of Problems Relative to Probabilistic Automata in the Frame of the Formal Languages Theory.

[BibT_eX]

[DOI]

Proceedings of the GI - 4. Jahrestagung, Berlin, 9.-12. Oktober 1974, 1974

1973

Equations of Formal Power Series over Non Commutative Semiring.

[BibT_eX]

Proceedings of the Mathematical Foundations of Computer Science: Proceedings of Symposium and Summer School, 1973

1972

Complexity Problems Related to the Approximation of Probabilistic Languages and Events by Deterministic Machines.

[BibT_eX]