Sciweavers

2137 search results - page 304 / 428
» Experiments on Graph Clustering Algorithms
Sort
View
KDD
2009
ACM
239views Data Mining» more  KDD 2009»
14 years 9 months ago
Tell me something I don't know: randomization strategies for iterative data mining
There is a wide variety of data mining methods available, and it is generally useful in exploratory data analysis to use many different methods for the same dataset. This, however...
Heikki Mannila, Kai Puolamäki, Markus Ojala, ...
KDD
2004
ACM
285views Data Mining» more  KDD 2004»
14 years 2 months ago
Effective localized regression for damage detection in large complex mechanical structures
In this paper, we propose a novel data mining technique for the efficient damage detection within the large-scale complex mechanical structures. Every mechanical structure is defi...
Aleksandar Lazarevic, Ramdev Kanapady, Chandrika K...
DAC
2010
ACM
13 years 10 months ago
Detecting tangled logic structures in VLSI netlists
This work proposes a new problem of identifying large and tangled logic structures in a synthesized netlist. Large groups of cells that are highly interconnected to each other can...
Tanuj Jindal, Charles J. Alpert, Jiang Hu, Zhuo Li...
BMCBI
2007
130views more  BMCBI 2007»
13 years 9 months ago
A robust measure of correlation between two genes on a microarray
Background: The underlying goal of microarray experiments is to identify gene expression patterns across different experimental conditions. Genes that are contained in a particula...
Johanna S. Hardin, Aya Mitani, Leanne Hicks, Brian...
HIPC
2009
Springer
13 years 6 months ago
Fast checkpointing by Write Aggregation with Dynamic Buffer and Interleaving on multicore architecture
Large scale compute clusters continue to grow to ever-increasing proportions. However, as clusters and applications continue to grow, the Mean Time Between Failures (MTBF) has redu...
Xiangyong Ouyang, Karthik Gopalakrishnan, Tejus Ga...