2137 search results - page 387 / 428 » Experiments on Graph Clustering Algorithms |
SIGMOD
2011
ACM
12 years 10 months ago
2011
ACM
To achieve high reliability and scalability, most large-scale data warehouse systems have adopted the cluster-based architecture. In this paper, we propose the design of a new clu...
AAAI
2011
12 years 7 months ago
2011
Latent relational search (LRS) is a novel approach for mapping knowledge across two domains. Given a source domain knowledge concerning the Moon, “The Moon is a satellite of the...
CIKM
2011
Springer
12 years 7 months ago
2011
Springer
Modern computing systems generate large amounts of log data. System administrators or domain experts utilize the log data to understand and optimize system behaviors. Most system ...
CAV
2010
Springer
13 years 11 months ago
2010
Springer
ions of ODE models (MAPLE, GNA). On the algorithmic side (Sec. 3.2), it supports two main streams in high-performance model checking: reachability analysis based on BDDs (symbolic)...
BMCBI
2008
13 years 7 months ago
2008
Background: In DNA microarray experiments, discovering groups of genes that share similar transcriptional characteristics is instrumental in functional annotation, tissue classifi...