Sciweavers

499 search results - page 43 / 100
» A Study on Latent Vulnerabilities
Sort
View
106
Voted
ACL
2012
13 years 2 months ago
Computational Approaches to Sentence Completion
This paper studies the problem of sentencelevel semantic coherence by answering SATstyle sentence completion questions. These questions test the ability of algorithms to distingui...
Geoffrey Zweig, John C. Platt, Christopher Meek, C...
122
Voted
AAAI
2012
13 years 2 months ago
Transfer Learning with Graph Co-Regularization
Transfer learning proves to be effective for leveraging labeled data in the source domain to build an accurate classifier in the target domain. The basic assumption behind transf...
Mingsheng Long, Jianmin Wang 0001, Guiguang Ding, ...
ICSE
2005
IEEE-ACM
16 years 17 days ago
Automatic discovery of API-level exploits
We argue that finding vulnerabilities in software components is different from finding exploits against them. Exploits that compromise security often use several low-level details...
Vinod Ganapathy, Sanjit A. Seshia, Somesh Jha, Tho...
100
Voted
CORR
2010
Springer
103views Education» more  CORR 2010»
15 years 17 days ago
Robust Matrix Decomposition with Outliers
Suppose a given observation matrix can be decomposed as the sum of a low-rank matrix and a sparse matrix (outliers), and the goal is to recover these individual components from th...
Daniel Hsu, Sham M. Kakade, Tong Zhang
ICA
2010
Springer
15 years 1 months ago
Binary Sparse Coding
We study a sparse coding learning algorithm that allows for a simultaneous learning of the data sparseness and the basis functions. The algorithm is derived based on a generative m...
Marc Henniges, Gervasio Puertas, Jörg Bornsch...