2612 search results - page 216 / 523 » Switching Graphs and Their Complexity |
201
click to vote
GBRPR
2009
Springer
15 years 4 months ago
2009
Springer
In this paper, we present a novel graph construction method and demonstrate its usage in a broad range of applications starting from a relatively simple single-surface segmentation...
207
click to vote
ICML
2007
IEEE
16 years 7 months ago
2007
IEEE
Graph clustering has become ubiquitous in the study of relational data sets. We examine two simple algorithms: a new graphical adaptation of the k-medoids algorithm and the Girvan...
199
Voted
CSR
2009
Springer
16 years 1 months ago
2009
Springer
The 2-Disjoint Connected Subgraphs problem asks if a given graph has two vertex-disjoint connected subgraphs containing prespecified sets of vertices. We show that this problem is...
200
click to vote
ICPR
2008
IEEE
16 years 1 months ago
2008
IEEE
To automatically register foreground target in cluttered images, we present a novel hierarchical graph representation and a stochastic computing strategy in Bayesian framework. Th...
175
click to vote
CC
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. To reason about programs, dynamic optimizers and analysis tools use sampling to collect a dynamic call graph (DCG). However, sampling has not achieved high accuracy with ...