522 search results - page 38 / 105 » The 3-Steiner Root Problem |
CLUSTER
2004
IEEE
14 years 13 days ago
2004
IEEE
The complexity and cost of isolating the root cause of system problems in large parallel computers generally scales with the size of the system. Syslog messages provide a primary ...
APPROX
2008
Springer
13 years 10 months ago
2008
Springer
In the Survivable Network Design Problem (SNDP) one seeks to find a minimum cost subgraph that satisfies prescribed node-connectivity requirements. We give a novel approximation r...
DBSEC
2008
13 years 10 months ago
2008
Abstract. Dishonest employees, who have privileges to obtain corporate critical information and access internal resources, cause the problem of internal leakage. Employees, who hav...
NIPS
2008
13 years 10 months ago
2008
We continue our study of online prediction of the labelling of a graph. We show a fundamental limitation of Laplacian-based algorithms: if the graph has a large diameter then the ...
NIPS
2008
13 years 10 months ago
2008
We propose a novel bound on single-variable marginal probability distributions in factor graphs with discrete variables. The bound is obtained by propagating local bounds (convex ...