5100 search results - page 404 / 1020 » The Linear Complexity of a Graph |
224
click to vote
ICML
2007
IEEE
16 years 8 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...
236
click to vote
CSR
2009
Springer
16 years 2 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...
216
click to vote
ICPR
2008
IEEE
16 years 2 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...
183
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 ...
240
click to vote
PPSWR
2005
Springer
16 years 1 months ago
2005
Springer
Metadata processing is recognized as a central challenge for database research in the next decade. Already, novel desktop data management and search applications (cf. Apple’s Spo...