961 search results - page 106 / 193 » Significance-Driven Graph Clustering |
136
click to vote
JODS
2007
15 years 4 months ago
2007
This paper describes a theoretical framework for inducing knowledge from incomplete data sets. The general framework can be used with any formalism based on a lattice structure. It...
112
click to vote
ICPR
2008
IEEE
15 years 11 months ago
2008
IEEE
This paper shows how to construct pattern vectors from the Ihara zeta function for the purposes of characterizing graph structures. To avoid the risk of sampling the meaningless i...
148
click to vote
CJ
1999
15 years 4 months ago
1999
We present a compiler optimization approach that uses the simulated evolution (SE) paradigm to enhance the finish time of heuristically scheduled computations with communication t...
172
click to vote
NAR
2002
15 years 4 months ago
2002
The Kyoto Encyclopedia of Genes and Genomes (KEGG) is the primary database resource of the Japanese GenomeNet service (http://www.genome.ad.jp/) for understanding higher order fun...
131
click to vote
DIS
2006
Springer
15 years 8 months ago
2006
Springer
Abstract. Clustering algorithms based on a matrix of pairwise similarities (kernel matrix) for the data are widely known and used, a particularly popular class being spectral clust...