Sciweavers

1285 search results - page 174 / 257
» On the Complexity of Ordinal Clustering
Sort
View
SPAA
1997
ACM
14 years 2 months ago
A Localized Algorithm for Parallel Association Mining
Discovery of association rules is an important database mining problem. Mining for association rules involves extracting patterns from large databases and inferring useful rules f...
Mohammed Javeed Zaki, Srinivasan Parthasarathy, We...
EDBT
2009
ACM
106views Database» more  EDBT 2009»
14 years 2 months ago
AlphaSum: size-constrained table summarization using value lattices
Consider a scientist who wants to explore multiple data sets to select the relevant ones for further analysis. Since the visualization real estate may put a stringent constraint o...
K. Selçuk Candan, Huiping Cao, Yan Qi 0002,...
CLUSTER
2008
IEEE
13 years 12 months ago
Efficient one-copy MPI shared memory communication in Virtual Machines
Efficient intra-node shared memory communication is important for High Performance Computing (HPC), especially with the emergence of multi-core architectures. As clusters continue ...
Wei Huang, Matthew J. Koop, Dhabaleswar K. Panda
AI
2010
Springer
13 years 10 months ago
Understanding the scalability of Bayesian network inference using clique tree growth curves
Bayesian networks (BNs) are used to represent and ef ciently compute with multi-variate probability distributions in a wide range of disciplines. One of the main approaches to per...
Ole J. Mengshoel
BMCBI
2008
133views more  BMCBI 2008»
13 years 10 months ago
A Web-based and Grid-enabled dChip version for the analysis of large sets of gene expression data
Background: Microarray techniques are one of the main methods used to investigate thousands of gene expression profiles for enlightening complex biological processes responsible f...
Luca Corradi, Marco Fato, Ivan Porro, Silvia Scagl...