1515 search results - page 244 / 303 » Parallel computing on any desktop |
131
click to vote
VLDB
2001
ACM
15 years 8 months ago
2001
ACM
We propose an novel method of computing and storing DataCubes. Our idea is to use Bayesian Networks, which can generate approximate counts for any query combination of attribute v...
123
Voted
SPAA
2009
ACM
16 years 4 months ago
2009
ACM
Dining philosophers is a classic scheduling problem for local mutual exclusion on arbitrary conflict graphs. We establish necessary conditions to solve wait-free dining under even...
145
Voted
HPCA
2002
IEEE
16 years 4 months ago
2002
IEEE
Clusters of high-end workstations and PCs are currently used in many application domains to perform large-scale computations or as scalable servers for I/O bound tasks. Although c...
155
click to vote
SPAA
2009
ACM
15 years 10 months ago
2009
ACM
We consider bit communication complexity of binary consensus in synchronous message passing systems with processes prone to crashes. A distributed algorithm is locally scalable wh...
143
click to vote
IPPS
2009
IEEE
15 years 10 months ago
2009
IEEE
Modeling communications in wireless networks is a challenging task since it asks for a simple mathematical object on which efficient algorithms can be designed, but that must also...