Sciweavers

1517 search results - page 268 / 304
» Hardening Functions for Large Scale Distributed Computations
Sort
View
121
Voted
CCGRID
2006
IEEE
15 years 9 months ago
GRENCHMARK: A Framework for Analyzing, Testing, and Comparing Grids
Grid computing is becoming the natural way to aggregate and share large sets of heterogeneous resources. With the infrastructure becoming ready for the challenge, current grid dev...
Alexandru Iosup, Dick H. J. Epema
SCP
2008
150views more  SCP 2008»
15 years 3 months ago
Google's MapReduce programming model - Revisited
Google's MapReduce programming model serves for processing large data sets in a massively parallel manner. We deliver the first rigorous description of the model including it...
Ralf Lämmel
154
Voted
RECOMB
2010
Springer
15 years 5 months ago
Algorithms for Detecting Significantly Mutated Pathways in Cancer
Abstract. Recent genome sequencing studies have shown that the somatic mutations that drive cancer development are distributed across a large number of genes. This mutational heter...
Fabio Vandin, Eli Upfal, Benjamin J. Raphael
APPROX
2005
Springer
111views Algorithms» more  APPROX 2005»
15 years 9 months ago
Sampling Bounds for Stochastic Optimization
A large class of stochastic optimization problems can be modeled as minimizing an objective function f that depends on a choice of a vector x ∈ X, as well as on a random external...
Moses Charikar, Chandra Chekuri, Martin Pál
148
Voted
IEEEPACT
2008
IEEE
15 years 10 months ago
Skewed redundancy
Technology scaling in integrated circuits has consistently provided dramatic performance improvements in modern microprocessors. However, increasing device counts and decreasing o...
Gordon B. Bell, Mikko H. Lipasti