Sciweavers

356 search results - page 40 / 72
» A computational approach to negative priming
Sort
View
CP
2009
Springer
15 years 10 months ago
Constraint-Based Optimal Testing Using DNNF Graphs
The goal of testing is to distinguish between a number of hypotheses about a systemfor example, dierent diagnoses of faults by applying input patterns and verifying or falsifying t...
Anika Schumann, Martin Sachenbacher, Jinbo Huang
SIGCSE
2010
ACM
181views Education» more  SIGCSE 2010»
15 years 4 months ago
Teaching the principles of the hacker curriculum to undergraduates
The “Hacker Curriculum” exists as a mostly undocumented set of principles and methods for learning about information security. Hacking, in our view, is defined by the ability...
Sergey Bratus, Anna Shubina, Michael E. Locasto
DISOPT
2011
175views Education» more  DISOPT 2011»
14 years 1 months ago
Strengthening lattice-free cuts using non-negativity
In recent years there has been growing interest in generating valid inequalities for mixedinteger programs using sets with 2 or more constraints. In particular, Andersen et al. (2...
Ricardo Fukasawa, Oktay Günlük
ICCV
2005
IEEE
15 years 11 months ago
A Supervised Learning Framework for Generic Object Detection in Images
In recent years Kernel Principal Component Analysis (Kernel PCA) has gained much attention because of its ability to capture nonlinear image features, which are particularly impor...
Saad Ali, Mubarak Shah
KI
2009
Springer
15 years 4 months ago
Planning with h +  in Theory and Practice
Abstract. Many heuristic estimators for classical planning are based on the socalled delete relaxation, which ignores negative effects of planning operators. Ideally, such heuristi...
Christoph Betz, Malte Helmert