Sciweavers

1285 search results - page 21 / 257
» On the Complexity of Ordinal Clustering
Sort
View
ICS
2004
Tsinghua U.
14 years 2 months ago
Cluster prefetch: tolerating on-chip wire delays in clustered microarchitectures
The growing dominance of wire delays at future technology points renders a microprocessor communication-bound. Clustered microarchitectures allow most dependence chains to execute...
Rajeev Balasubramonian
BMCBI
2006
154views more  BMCBI 2006»
13 years 8 months ago
Analysis with respect to instrumental variables for the exploration of microarray data structures
Background: Evaluating the importance of the different sources of variations is essential in microarray data experiments. Complex experimental designs generally include various fa...
Florent Baty, Michaël Facompré, Jan Wi...
ICPR
2010
IEEE
14 years 2 months ago
On the Scalability of Evidence Accumulation Clustering
Abstract—This work focuses on the scalability of the Evidence Accumulation Clustering (EAC) method. We first address the space complexity of the co-association matrix. The spars...
André Lourenço, Ana Luisa Nobre Fred, Anil Jain
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...
ECML
2006
Springer
14 years 14 days ago
Fast Spectral Clustering of Data Using Sequential Matrix Compression
Spectral clustering has attracted much research interest in recent years since it can yield impressively good clustering results. Traditional spectral clustering algorithms first s...
Bo Chen, Bin Gao, Tie-Yan Liu, Yu-Fu Chen, Wei-Yin...