Sciweavers

8125 search results - page 1278 / 1625
» Parallelism and evolutionary algorithms
Sort
View
157
Voted
PODC
2009
ACM
16 years 6 months ago
Correctness of gossip-based membership under message loss
Due to their simplicity and effectiveness, gossip-based membership protocols have become the method of choice for maintaining partial membership in large P2P systems. A variety of...
Maxim Gurevich, Idit Keidar
PODC
2009
ACM
16 years 6 months ago
Dynamic atomic storage without consensus
This paper deals with the emulation of atomic read/write (R/W) storage in dynamic asynchronous message passing systems. In static settings, it is well known that atomic R/W storag...
Marcos Kawazoe Aguilera, Idit Keidar, Dahlia Malkh...
SIGMOD
2009
ACM
291views Database» more  SIGMOD 2009»
16 years 6 months ago
Partial join order optimization in the paraccel analytic database
The ParAccel Analytic DatabaseTM is a fast shared-nothing parallel relational database system with a columnar orientation, adaptive compression, memory-centric design, and an enha...
Yijou Chen, Richard L. Cole, William J. McKenna, S...
SIGMOD
2007
ACM
190views Database» more  SIGMOD 2007»
16 years 6 months ago
Map-reduce-merge: simplified relational data processing on large clusters
Map-Reduce is a programming model that enables easy development of scalable parallel applications to process vast amounts of data on large clusters of commodity machines. Through ...
Hung-chih Yang, Ali Dasdan, Ruey-Lung Hsiao, Dougl...
169
Voted
WWW
2010
ACM
16 years 1 months ago
Distributed nonnegative matrix factorization for web-scale dyadic data analysis on mapreduce
The Web abounds with dyadic data that keeps increasing by every single second. Previous work has repeatedly shown the usefulness of extracting the interaction structure inside dya...
Chao Liu, Hung-chih Yang, Jinliang Fan, Li-Wei He,...
« Prev « First page 1278 / 1625 Last » Next »