149 search results - page 12 / 30 » On Finding Minimum Deadly Sets for Directed Networks |
KDD
2004
ACM
14 years 8 months ago
2004
ACM
The paper presents a method for pruning frequent itemsets based on background knowledge represented by a Bayesian network. The interestingness of an itemset is defined as the abso...
DAC
1994
ACM
13 years 11 months ago
1994
ACM
Previous attempts to capture the phenomenon of output don't care sequencesfor a componentin an FSM network have been incomplete. We demonstrate that output don't care se...
EVOW
2001
Springer
13 years 12 months ago
2001
Springer
Augmenting an existing network with additional links to achieve higher robustness and survivability plays an important role in network design. We consider the problem of augmenting...
GLOBECOM
2007
IEEE
13 years 11 months ago
2007
IEEE
Wireless sensor networks have been widely used in many surveillance applications. Due to the importance of sensor nodes in such applications, certain level of protection needs to b...
ICML
2003
IEEE
14 years 8 months ago
2003
IEEE
In this paper, we address the problem of finding the pre-image of a feature vector in the feature space induced by a kernel. This is of central importance in some kernel applicatio...