1026 search results - page 143 / 206 » On Finding Minimal w-cutset |
149
click to vote
SCAI
2008
15 years 6 months ago
2008
We propose a troubleshooting algorithm that can troubleshoot systems with dependent action costs. When actions are performed they may change the way the system is decomposed and af...
135
click to vote
AAAI
2004
15 years 6 months ago
2004
In this paper we introduce and study Shortest Path Discovery (SPD) problems, a generalization of shortest path problems: In SPD one is given a directed edgeweighted graph and the ...
169
click to vote
CATS
2006
15 years 6 months ago
2006
We consider the following clustering problems: given a general undirected graph, partition its vertices into disjoint clusters such that each cluster forms a clique and the number...
150
click to vote
DC
2001
15 years 6 months ago
2001
This paper presents a streamlined metadata record format designed to support the permanence of network discoverable objects. It starts with the Dublin Core consensus and distills ...
152
click to vote
DICTA
2003
15 years 6 months ago
2003
In this paper, we propose a robust method to estimate the fundamental matrix in the presence of outliers. The new method uses random minimum subsets as a search engine to find inli...