5640 search results - page 946 / 1128 » Parallelizing the Data Cube |
KDD
2007
ACM
14 years 10 months ago
2007
ACM
The web provides an unprecedented opportunity to evaluate ideas quickly using controlled experiments, also called randomized experiments (single-factor or factorial designs), A/B ...
ICCAD
2006
IEEE
14 years 7 months ago
2006
IEEE
A dynamically reconfigurable processor (DRP) is designed to achieve high area efficiency by switching reconfigurable data paths dynamically. Our DRP architecture has a stand alone...
SRDS
2008
IEEE
14 years 4 months ago
2008
IEEE
Distributed storage systems often use data replication to mask failures and guarantee high data availability. Node failures can be transient or permanent. While the system must ge...
CIKM
2007
Springer
14 years 4 months ago
2007
Springer
Visualizing network data, from tree structures to arbitrarily connected graphs, is a difficult problem in information visualization. A large part of the problem is that in network...
ISCA
2006
IEEE
14 years 4 months ago
2006
IEEE
Thread-level speculation (TLS) has proven to be a promising method of extracting parallelism from both integer and scientific workloads, targeting speculative threads that range ...