default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDValentino Crespi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[c10]Eleonora Ficiarà
, Valentino Crespi, Shruti Prashant Gadewar, Sophia I. Thomopoulos, Joshua Boyd, Paul M. Thompson, Neda Jahanshad, Fabrizio Pizzagalli:
Predicting Progression from Mild Cognitive Impairment to Alzheimer's Disease using MRI-based Cortical Features and a Two-State Markov Model. ISBI 2021: 1145-1149- [c9]Sami Abu-El-Haija, Hesham Mostafa, Marcel Nassar, Valentino Crespi, Greg Ver Steeg, Aram Galstyan:
Implicit SVD for Graph Representation Learning. NeurIPS 2021: 8419-8431 - [i6]Sami Abu-El-Haija, Valentino Crespi, Greg Ver Steeg, Aram Galstyan:
Fast Graph Learning with Unique Optimal Solutions. CoRR abs/2102.08530 (2021) - [i5]Valentino Crespi, Wes Hardaker, Sami Abu-El-Haija, Aram Galstyan:
Identifying botnet IP address clusters using natural language processing techniques on honeypot command logs. CoRR abs/2104.10232 (2021) - [i4]Sami Abu-El-Haija, Hesham Mostafa, Marcel Nassar, Valentino Crespi, Greg Ver Steeg, Aram Galstyan:
Implicit SVD for Graph Representation Learning. CoRR abs/2111.06312 (2021)
2010 – 2019
- 2013
- [j7]Valentino Crespi, George Cybenko, Annarita Giani:
Engineering Statistical Behaviors for Attacking and Defending Covert Channels. IEEE J. Sel. Top. Signal Process. 7(1): 124-136 (2013) - 2011
- [j6]George Cybenko, Valentino Crespi:
Learning Hidden Markov Models Using Nonnegative Matrix Factorization. IEEE Trans. Inf. Theory 57(6): 3963-3970 (2011) - [i3]Valentino Crespi, George Cybenko, Annarita Giani:
Attacking and Defending Covert Channels and Behavioral Models. CoRR abs/1104.5071 (2011)
2000 – 2009
- 2008
- [j5]Valentino Crespi, Aram Galstyan, Kristina Lerman:
Top-down vs bottom-up methodologies in multi-agent system design. Auton. Robots 24(3): 303-313 (2008) - [j4]Valentino Crespi, George Cybenko, Guofei Jiang:
The theory of trackability with applications to sensor networks. ACM Trans. Sens. Networks 4(3): 16:1-16:42 (2008) - [i2]George Cybenko, Valentino Crespi:
Learning Hidden Markov Models using Non-Negative Matrix Factorization. CoRR abs/0809.4086 (2008) - 2006
- [j3]Rza Bashirov, Valentino Crespi:
Analyzing permutation capability of multistage interconnection networks with colored Petri nets. Inf. Sci. 176(21): 3143-3165 (2006) - [c8]Russ Abbott, Vladimir Akis, Valentino Crespi, Huiping Guo, Jiang Guo, Eun-Young Elaine Kang, Raj Pamula, Behzad Parviz, Chengyu Sun:
Continuous improvement of the Computer Science Undergraduate Program at CSULA. FECS 2006: 314-320 - 2005
- [j2]Diego Hernando, Valentino Crespi, George Cybenko:
Efficient computation of the hidden Markov model entropy for a given observation sequence. IEEE Trans. Inf. Theory 51(7): 2681-2685 (2005) - [c7]Valentino Crespi, Aram Galstyan, Kristina Lerman:
Comparative analysis of top-down and bottom-up methodologies for multi-agent system design. AAMAS 2005: 1159-1160 - [c6]Russ Abbott, Vladimir Akis, Valentino Crespi, Jiang Guo, Eun-Young Elaine Kang, Raj Pamula, Behzad Parviz, Chengyu Sun:
Assessment and Accreditation of Computer Science Undergraduate Program. FECS 2005: 203-209 - [c5]Rza Bashirov, Valentino Crespi:
Quantitative Analysis of Permutation Capability with Colored Petri Nets. MASCOTS 2005: 463-470 - 2004
- [j1]Valentino Crespi:
Exact Formulae for the Lova'sz Theta Function of Sparse Circulant Graphs. SIAM J. Discret. Math. 17(4): 670-674 (2004) - [c4]Russ Abbott, Valentino Crespi:
Potential-Based Processing for Action-Game Experimentation. IC-AI 2004: 1167-1170 - 2003
- [c3]Javed A. Aslam, Zack J. Butler, Florin Constantin, Valentino Crespi, George Cybenko, Daniela Rus:
Tracking a moving object with a binary sensor network. SenSys 2003: 150-161 - [i1]Valentin E. Brimkov, Bruno Codenotti, Valentino Crespi, Reneta P. Barneva, Mauro Leoncini:
Computation of the Lovász Theta Function for Circulant Graphs. Electron. Colloquium Comput. Complex. TR03 (2003) - 2000
- [c2]Valentin E. Brimkov, Bruno Codenotti, Valentino Crespi, Mauro Leoncini:
On the Lovász Number of Certain Circulant Graphs. CIAC 2000: 291-305
1990 – 1999
- 1997
- [c1]Anna Bernasconi, Bruno Codenotti, Valentino Crespi, Giovanni Resta:
Computing Groebner Bases in the Boolean Setting with Applications to Counting. WAE 1997: 209-218
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-08 20:57 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
