Sciweavers

144 search results - page 11 / 29
» Decision tree modeling with relational views
Sort
View
EMMCVPR
2001
Springer
14 years 11 days ago
A Hierarchical Markov Random Field Model for Figure-Ground Segregation
To segregate overlapping objects into depth layers requires the integration of local occlusion cues distributed over the entire image into a global percept. We propose to model thi...
Stella X. Yu, Tai Sing Lee, Takeo Kanade
DBSEC
2006
131views Database» more  DBSEC 2006»
13 years 9 months ago
Interactive Analysis of Attack Graphs Using Relational Queries
Abstract. Attack graph is important in defending against well-orchestrated network intrusions. However, the current analysis of attack graphs requires an algorithm to be developed ...
Lingyu Wang, Chao Yao, Anoop Singhal, Sushil Jajod...
ATVA
2007
Springer
136views Hardware» more  ATVA 2007»
14 years 2 months ago
Symbolic Fault Tree Analysis for Reactive Systems
Fault tree analysis is a traditional and well-established technique for analyzing system design and robustness. Its purpose is to identify sets of basic events, called cut sets, wh...
Marco Bozzano, Alessandro Cimatti, Francesco Tappa...
NIPS
2004
13 years 9 months ago
The Power of Selective Memory: Self-Bounded Learning of Prediction Suffix Trees
Prediction suffix trees (PST) provide a popular and effective tool for tasks such as compression, classification, and language modeling. In this paper we take a decision theoretic...
Ofer Dekel, Shai Shalev-Shwartz, Yoram Singer
CAV
2009
Springer
134views Hardware» more  CAV 2009»
14 years 8 months ago
Predecessor Sets of Dynamic Pushdown Networks with Tree-Regular Constraints
Abstract. Dynamic Pushdown Networks (DPNs) are a model for parallel programs with (recursive) procedures and process creation. The goal of this paper is to develop generic techniqu...
Alexander Wenner, Markus Müller-Olm, Peter La...