Search the dblp DataBase

Publications of Author

1. Valentino Crespi, Aram Galstyan, Kristina Lerman
   Comparative analysis of top-down and bottom-up methodologies for multi-agent system design. [Citation Graph (0, 0)][DBLP]
   AAMAS, 2005, pp:1159-1160 [Conf]
   
2. Valentin E. Brimkov, Bruno Codenotti, Valentino Crespi, Mauro Leoncini
   On the Lovász Number of Certain Circulant Graphs. [Citation Graph (0, 0)][DBLP]
   CIAC, 2000, pp:291-305 [Conf]
   
3. Russ Abbott, Vladimir Akis, Valentino Crespi, Jiang Guo, Elaine Kang, Raj Pamula, Behzad Parviz, Chengyu Sun
   Assessment and Accreditation of Computer Science Undergraduate Program. [Citation Graph (0, 0)][DBLP]
   FECS, 2005, pp:203-209 [Conf]
   
4. Russ Abbott, Vladimir Akis, Valentino Crespi, Huiping Guo, Jiang Guo, Eun-Young Kang, Raj Pamula, Behzad Parviz, Chengyu Sun
   Continuous improvement of the Computer Science Undergraduate Program at CSULA. [Citation Graph (0, 0)][DBLP]
   FECS, 2006, pp:314-320 [Conf]
   
5. Russ Abbott, Valentino Crespi
   Potential-Based Processing for Action-Game Experimentation. [Citation Graph (0, 0)][DBLP]
   IC-AI, 2004, pp:1167-1170 [Conf]
   
6. Rza Bashirov, Valentino Crespi
   Quantitative Analysis of Permutation Capability with Colored Petri Nets. [Citation Graph (0, 0)][DBLP]
   MASCOTS, 2005, pp:463-470 [Conf]
   
7. Javed A. Aslam, Zack J. Butler, Florin Constantin, Valentino Crespi, George Cybenko, Daniela Rus
   Tracking a moving object with a binary sensor network. [Citation Graph (0, 0)][DBLP]
   SenSys, 2003, pp:150-161 [Conf]
   
8. Valentin E. Brimkov, Bruno Codenotti, Valentino Crespi, Reneta P. Barneva, Mauro Leoncini
   Computation of the Lovász Theta Function for Circulant Graphs [Citation Graph (0, 0)][DBLP]
   Electronic Colloquium on Computational Complexity (ECCC), 2003, v:, n:081, pp:- [Journal]
   
9. Rza Bashirov, Valentino Crespi
   Analyzing permutation capability of multistage interconnection networks with colored Petri nets. [Citation Graph (0, 0)][DBLP]
   Inf. Sci., 2006, v:176, n:21, pp:3143-3165 [Journal]
   
10. Valentino Crespi
    Exact Formulae for the Lova'sz Theta Function of Sparse Circulant Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2004, v:17, n:4, pp:670-674 [Journal]
    
11. Diego Hernando, Valentino Crespi, George Cybenko
    Efficient computation of the hidden Markov model entropy for a given observation sequence. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2005, v:51, n:7, pp:2681-2685 [Journal]
    
12. 
    Top-down vs bottom-up methodologies in multi-agent system design. [Citation Graph (, )][DBLP]
    
    
13. 
    Learning Hidden Markov Models using Non-Negative Matrix Factorization [Citation Graph (, )][DBLP]