Sciweavers

4714 search results - page 620 / 943
» The Complexity of Iterated Multiplication
Sort
View
KDD
2005
ACM
165views Data Mining» more  KDD 2005»
16 years 7 months ago
Co-clustering by block value decomposition
Dyadic data matrices, such as co-occurrence matrix, rating matrix, and proximity matrix, arise frequently in various important applications. A fundamental problem in dyadic data a...
Bo Long, Zhongfei (Mark) Zhang, Philip S. Yu
KDD
2002
ACM
145views Data Mining» more  KDD 2002»
16 years 7 months ago
Handling very large numbers of association rules in the analysis of microarray data
The problem of analyzing microarray data became one of important topics in bioinformatics over the past several years, and different data mining techniques have been proposed for ...
Alexander Tuzhilin, Gediminas Adomavicius
CHI
2005
ACM
16 years 7 months ago
Evaluating navigational surrogate formats with divergent browsing tasks
Navigational surrogates are representations that stand for information resources within search engine result sets, e-commerce sites, and digital libraries. They also form the basi...
Andruid Kerne, Steven M. Smith, Hyun Choi, Ross Gr...
HPCA
2001
IEEE
16 years 7 months ago
CARS: A New Code Generation Framework for Clustered ILP Processors
Clustered ILP processors are characterized by a large number of non-centralized on-chip resources grouped into clusters. Traditional code generation schemes for these processors c...
Krishnan Kailas, Kemal Ebcioglu, Ashok K. Agrawala
SDM
2009
SIAM
149views Data Mining» more  SDM 2009»
16 years 4 months ago
Speeding Up Secure Computations via Embedded Caching.
Most existing work on Privacy-Preserving Data Mining (PPDM) focus on enabling conventional data mining algorithms with the ability to run in a secure manner in a multi-party setti...
K. Zhai, W. K. Ng, A. R. Herianto, S. Han