656 search results - page 61 / 132 » Graph Theoretical Characterization and Computation of Answer... |
IJCAI
1993
15 years 2 months ago
1993
The Dempster-Shafer theory gives a solid basis for reasoning applications characterized by uncertainty. A key feature of the theory is that propositions are represented as subsets...
108
click to vote
STACS
2001
Springer
15 years 5 months ago
2001
Springer
The stretch factor of a Euclidean graph is the maximum ratio of the distance in the graph between any two points and their Euclidean distance. Given a set S of n points in Rd, we ...
100
click to vote
ICDM
2006
IEEE
15 years 7 months ago
2006
IEEE
This work presents a systematic comparison between seven kernels (or similarity matrices) on a graph, namely the exponential diffusion kernel, the Laplacian diffusion kernel, the ...
106
click to vote
ICDM
2010
IEEE
14 years 11 months ago
2010
IEEE
Given a large graph, like a computer network, which k nodes should we immunize (or monitor, or remove), to make it as robust as possible against a computer virus attack? We need (...
CVPR
2010
IEEE
15 years 10 months ago
2010
IEEE
Graph cuts methods are at the core of many state-of-theart algorithms in computer vision due to their efficiency in computing globally optimal solutions. In this paper, we solve t...