227 search results - page 21 / 46 » Weighted Coloring: Further Complexity and Approximability Re... |
STOC
2007
ACM
14 years 8 months ago
2007
ACM
In the MINIMUM BOUNDED DEGREE SPANNING TREE problem, we are given an undirected graph with a degree upper bound Bv on each vertex v, and the task is to find a spanning tree of min...
AI
2011
Springer
13 years 2 months ago
2011
Springer
The paper focuses on developing effective importance sampling algorithms for mixed probabilistic and deterministic graphical models. The use of importance sampling in such graphi...
TNN
1998
13 years 7 months ago
1998
— In this paper, we perform a complete asymptotic performance analysis of the stochastic approximation algorithm (denoted subspace network learning algorithm) derived from Oja’...
RECOMB
2007
Springer
14 years 8 months ago
2007
Springer
Abstract. Side-chain prediction is an important subproblem of the general protein folding problem. Despite much progress in side-chain prediction, performance is far from satisfact...
ICC
2007
IEEE
14 years 2 months ago
2007
IEEE
— The capacity of multiple input multiple output (MIMO) system over wireless channels has been investigated analytically and by simulation over different types of wireless fading...