Sciweavers

1782 search results - page 176 / 357
» Learning in Parallel Universes
Sort
View
136
Voted
PODC
2006
ACM
15 years 9 months ago
Quorum placement in networks: minimizing network congestion
A quorum system over a universe of logical elements is a collection of subsets (quorums) of elements, any two of which intersect. In numerous distributed algorithms, the elements ...
Daniel Golovin, Anupam Gupta, Bruce M. Maggs, Flor...
136
Voted
IPPS
2005
IEEE
15 years 9 months ago
Processor Allocation for Tasks that is Robust Against Errors in Computation Time Estimates
Heterogeneous computing systems composed of interconnected machines with varied computational capabilities often operate in environments where there may be sudden machine failures...
Prasanna Sugavanam, Howard Jay Siegel, Anthony A. ...
124
Voted
ICS
2001
Tsinghua U.
15 years 8 months ago
Optimizing strategies for telescoping languages: procedure strength reduction and procedure vectorization
At Rice University, we have undertaken a project to construct a framework for generating high-level problem solving languages that can achieve high performance on a variety of pla...
Arun Chauhan, Ken Kennedy
142
Voted
IPPS
2003
IEEE
15 years 9 months ago
SPMD Image Processing on Beowulf Clusters: Directives and Libraries
Most image processing algorithms can be parallelized by splitting parallel loops and by using very few communication patterns. Code parallelization using MPI still involves much p...
Paulo F. Oliveira, J. M. Hans du Buf
185
Voted
WWW
2010
ACM
15 years 10 months ago
Factorizing personalized Markov chains for next-basket recommendation
Recommender systems are an important component of many websites. Two of the most popular approaches are based on matrix factorization (MF) and Markov chains (MC). MF methods learn...
Steffen Rendle, Christoph Freudenthaler, Lars Schm...