Sciweavers

612 search results - page 61 / 123
» Using Data Compressors to Construct Rank Tests
Sort
View
SOFTVIS
2010
ACM
15 years 3 months ago
Towards anomaly comprehension: using structural compression to navigate profiling call-trees
Developers must often diagnose anomalies in programs they only have a partial knowledge of. As a result, they must simultaneously reverse engineer parts of the system they are unf...
Shen Lin 0003, François Taïani, Thomas...
PASTE
2010
ACM
15 years 8 months ago
Learning universal probabilistic models for fault localization
Recently there has been significant interest in employing probabilistic techniques for fault localization. Using dynamic dependence information for multiple passing runs, learnin...
Min Feng, Rajiv Gupta
164
Voted
ACL
2011
14 years 7 months ago
Semi-Supervised Frame-Semantic Parsing for Unknown Predicates
We describe a new approach to disambiguating semantic frames evoked by lexical predicates previously unseen in a lexicon or annotated data. Our approach makes use of large amounts...
Dipanjan Das, Noah A. Smith
MVA
2000
172views Computer Vision» more  MVA 2000»
15 years 4 months ago
Partial Face Extraction and Recognition Using Radial Basis Function Networks
work, applies a nonlinear transformation from the input space to the hidden space. The output layer Partial face images, e.g.1 eyes, nose, and ear supplies the response of the netw...
Nan He, Kiminori Sato, Yukitoshi Takahashi
CIKM
2009
Springer
15 years 10 months ago
L2 norm regularized feature kernel regression for graph data
Features in many real world applications such as Cheminformatics, Bioinformatics and Information Retrieval have complex internal structure. For example, frequent patterns mined fr...
Hongliang Fei, Jun Huan