We study the problem of learning an optimal Bayesian network in a constrained search space; skeletons are compelled to be subgraphs of a given undirected graph called the super-st...
Kaname Kojima, Eric Perrier, Seiya Imoto, Satoru M...
Given two sets of strings, consider the problem to find a subsequence that is common to one set but never appears in the other set. The problem is known to be NP-complete. We gene...
—We address the problem of code optimization for embedded DSP microprocessors. Such processors (e.g., those in the TMS320 series) have highly irregular datapaths, and conventiona...
Stan Y. Liao, Srinivas Devadas, Kurt Keutzer, Stev...
— Although there is a trend in reducing the number of layers in core and metropolitan area networks, still the optimal design of multi-layer networks (like IP over WDM) remains a...
Abstract-- Due to the development of Next Generation Networks, leading to a multiservice transport layer with a multidomain environment, the importance of interconnection issues ke...