Sciweavers

2512 search results - page 292 / 503
» Learning from Highly Structured Data by Decomposition
Sort
View
ATS
2009
IEEE
142views Hardware» more  ATS 2009»
15 years 11 months ago
Speeding up SAT-Based ATPG Using Dynamic Clause Activation
Abstract—SAT-based ATPG turned out to be a robust alternative to classical structural ATPG algorithms such as FAN. The number of unclassified faults can be significantly reduce...
Stephan Eggersglüß, Daniel Tille, Rolf ...
KDD
2010
ACM
272views Data Mining» more  KDD 2010»
15 years 8 months ago
Beyond heuristics: learning to classify vulnerabilities and predict exploits
The security demands on modern system administration are enormous and getting worse. Chief among these demands, administrators must monitor the continual ongoing disclosure of sof...
Mehran Bozorgi, Lawrence K. Saul, Stefan Savage, G...
FSKD
2007
Springer
98views Fuzzy Logic» more  FSKD 2007»
15 years 10 months ago
Learning Selective Averaged One-Dependence Estimators for Probability Estimation
Naïve Bayes is a well-known effective and efficient classification algorithm, but its probability estimation performance is poor. Averaged One-Dependence Estimators, simply AODE,...
Qing Wang, Chuan-hua Zhou, Jiankui Guo
KDD
2007
ACM
198views Data Mining» more  KDD 2007»
16 years 4 months ago
Applying Link-Based Classification to Label Blogs
In analyzing data from social and communication networks, we encounter the problem of classifying objects where there is an explicit link structure amongst the objects. We study t...
Smriti Bhagat, Graham Cormode, Irina Rozenbaum
124
Voted
CAV
2010
Springer
214views Hardware» more  CAV 2010»
15 years 8 months ago
Learning Component Interfaces with May and Must Abstractions
elor Thesis: Demand Driven Abstraction Refinement • Advisor: Dr. Andrey Rybalchenko Kendriya Vidyalaya ONGC, Dehradun, Uttaranchal INDIA All India Senior Secondary Examination, ...
Rishabh Singh, Dimitra Giannakopoulou, Corina S. P...