Sciweavers

1670 search results - page 32 / 334
» Fast Computation of Data Correlation Using BDDs
Sort
View
SAC
2006
ACM
14 years 2 months ago
A probability analysis for candidate-based frequent itemset algorithms
This paper explores the generation of candidates, which is an important step in frequent itemset mining algorithms, from a theoretical point of view. Important notions in our prob...
Nele Dexters, Paul W. Purdom, Dirk Van Gucht
EENERGY
2010
14 years 11 days ago
Statistical static capacity management in virtualized data centers supporting fine grained QoS specification
From an ecological but also from an economical and in the meantime a technical view the fast ongoing increase of power consumption in today’s data centers is no longer feasible....
Marko Hoyer, Kiril Schröder, Wolfgang Nebel
ESANN
2006
13 years 10 months ago
Stochastic Processes for Canonical Correlation Analysis
We consider two stochastic process methods for performing canonical correlation analysis (CCA). The first uses a Gaussian Process formulation of regression in which we use the cur...
Colin Fyfe, Gayle Leen
IPPS
1997
IEEE
14 years 1 days ago
A Fast Scalable Universal Matrix Multiplication Algorithm on Distributed-Memory Concurrent Computers
We present a fast and scalable matrix multiplication algorithm on distributed memory concurrent computers, whose performance is independent of data distribution on processors, and...
J. Choi
RECOMB
2003
Springer
14 years 8 months ago
Approximation of protein structure for fast similarity measures
It is shown that structural similarity between proteins can be decided well with much less information than what is used in common similarity measures. The full C representation c...
Fabian Schwarzer, Itay Lotan