This article presents and analyzes algorithms that systematically generate random Bayesian networks of varying difficulty levels, with respect to inference using tree clustering. ...
We introduce a graph clustering problem motivated by a stream processing application. Input to our problem is an undirected graph with vertex and edge weights. A cluster is a subse...
In this paper, we present a new efficient strategy for constructing a wireless tree network containing n nodes of diameter while satisfying the QoS requirements such as bandwidth...
This paper proposes two methods which take advantage of k -mean clustering algorithm to decrease the number of support vectors (SVs) for the training of support vector machine (SVM...
Xiao-Lei Xia, Michael R. Lyu, Tat-Ming Lok, Guang-...
In this paper we present a new clustered mesh FPGA architecture where each cluster local interconnect is implemented as an MFPGA tree network [6]. Unlike previous clustered mesh a...
Zied Marrakchi, Hayder Mrabet, Christian Masson, H...