Computing Groebner Bases in the Boolean Setting with Applications to Counting. - Anna Bernasconi 001; Bruno Codenotti; Valentino Crespi; Giovanni Resta (WAE, 1997)

On the Lovász Number of Certain Circulant Graphs. - Valentin E. Brimkov; Bruno Codenotti; Valentino Crespi; Mauro Leoncini (CIAC, 2000)

Decentralized algorithms for sensor registration. - Valentino Crespi; George Cybenko (IJCNN, 2003)

Tracking a moving object with a binary sensor network. - Javed A. Aslam; Zack J. Butler; Florin Constantin; Valentino Crespi; George Cybenko; Daniela Rus (SenSys, 2003)

Computation of the Lovász Theta Function for Circulant Graphs - Valentin E. Brimkov; Bruno Codenotti; Valentino Crespi; Reneta P. Barneva; Mauro Leoncini (Electron. Colloquium Comput. Complex., 2003)

Potential-Based Processing for Action-Game Experimentation. - Russ Abbott; Valentino Crespi (IC-AI, 2004)

Exact Formulae for the Lova'sz Theta Function of Sparse Circulant Graphs. - Valentino Crespi (SIAM J. Discret. Math., 2004)

Comparative analysis of top-down and bottom-up methodologies for multi-agent system design. - Valentino Crespi; Aram Galstyan; Kristina Lerman (AAMAS, 2005)

Assessment and Accreditation of Computer Science Undergraduate Program. - Russ Abbott; Vladimir Akis; Valentino Crespi; Jiang Guo; Eun-Young Elaine Kang; Raj Pamula; Behzad Parviz; Chengyu Sun (FECS, 2005)

Quantitative Analysis of Permutation Capability with Colored Petri Nets. - Rza Bashirov; Valentino Crespi (MASCOTS, 2005)

Efficient computation of the hidden Markov model entropy for a given observation sequence. - Diego Hernando; Valentino Crespi; George Cybenko (IEEE Trans. Inf. Theory, 2005)

Continuous improvement of the Computer Science Undergraduate Program at CSULA. - Russ Abbott; Vladimir Akis; Valentino Crespi; Huiping Guo; Jiang Guo; Eun-Young Elaine Kang; Raj Pamula; Behzad Parviz; Chengyu Sun (FECS, 2006)

Analyzing permutation capability of multistage interconnection networks with colored Petri nets. - Rza Bashirov; Valentino Crespi (Inf. Sci., 2006)

Top-down vs bottom-up methodologies in multi-agent system design. - Valentino Crespi; Aram Galstyan; Kristina Lerman (Auton. Robots, 2008)

Learning Hidden Markov Models using Non-Negative Matrix Factorization - George Cybenko; Valentino Crespi (CoRR, 2008)

The theory of trackability with applications to sensor networks. - Valentino Crespi; George Cybenko; Guofei Jiang (ACM Trans. Sens. Networks, 2008)

Attacking and Defending Covert Channels and Behavioral Models - Valentino Crespi; George Cybenko; Annarita Giani (CoRR, 2011)

Learning Hidden Markov Models Using Nonnegative Matrix Factorization. - George Cybenko; Valentino Crespi (IEEE Trans. Inf. Theory, 2011)

Engineering Statistical Behaviors for Attacking and Defending Covert Channels. - Valentino Crespi; George Cybenko; Annarita Giani (IEEE J. Sel. Top. Signal Process., 2013)

Predicting Progression from Mild Cognitive Impairment to Alzheimer's Disease using MRI-based Cortical Features and a Two-State Markov Model. - Eleonora Ficiarà; Valentino Crespi; Shruti Prashant Gadewar; Sophia I. Thomopoulos; Joshua Boyd; Paul M. Thompson; Neda Jahanshad; Fabrizio Pizzagalli (ISBI, 2021)

Implicit SVD for Graph Representation Learning. - Sami Abu-El-Haija; Hesham Mostafa; Marcel Nassar; Valentino Crespi; Greg Ver Steeg; Aram Galstyan (NeurIPS, 2021)

Fast Graph Learning with Unique Optimal Solutions. - Sami Abu-El-Haija; Valentino Crespi; Greg Ver Steeg; Aram Galstyan (CoRR, 2021)

Identifying botnet IP address clusters using natural language processing techniques on honeypot command logs. - Valentino Crespi; Wes Hardaker; Sami Abu-El-Haija; Aram Galstyan (CoRR, 2021)