1395 search results - page 239 / 279 » (k, )-Distance-Hereditary Graphs |
DAC
1994
ACM
14 years 1 months ago
1994
ACM
In this paper, we consider the problem of calculating the signal and transition probabilities of the internal nodes of the combinational logic part of a nite state machine (FSM). ...
FCCM
2004
IEEE
14 years 1 months ago
2004
IEEE
Intrusion detection for network security is a computation intensive application demanding high system performance. System level design, a relatively unexplored field in this area,...
WG
1995
Springer
14 years 1 months ago
1995
Springer
We propose an O(n4) algorithm to build the modular decomposition tree of hypergraphs of dimension 3 and show how this algorithm can be generalized to compute in O(n3k−5) time th...
UAI
2004
13 years 11 months ago
2004
We show that the class of strongly connected graphical models with treewidth at most k can be properly efficiently PAC-learnt with respect to the Kullback-Leibler Divergence. Prev...
COR
2007
13 years 9 months ago
2007
We present new primal-dual algorithms for several network design problems. The problems considered are the generalized Steiner tree problem (GST), the directed Steiner tree proble...