3018 search results - page 332 / 604 » Replicating for Performance: Case Studies |
169
click to vote
KDD
2001
ACM
16 years 7 months ago
2001
ACM
We consider prediction-model evaluation in the context of marketing-campaign planning. In order to evaluate and compare models with specific campaign objectives in mind, we need t...
151
click to vote
STOC
2002
ACM
16 years 7 months ago
2002
ACM
: We initiate the study of a new measure of approximation. This measure compares the performance of an approximation algorithm to the random assignment algorithm. This is a useful ...
154
click to vote
ICSE
2003
IEEE-ACM
16 years 6 months ago
2003
IEEE-ACM
Benchmarks have been used in computer science to compare the performance of computer systems, information retrieval algorithms, databases, and many other technologies. The creatio...
169
click to vote
DCC
2004
IEEE
16 years 6 months ago
2004
IEEE
The recently proposed turbo-binning scheme is shown to be both efficient and optimal for uniform source Slepian-Wolf coding problem [1]. This paper studies the case when sources a...
186
click to vote
PPOPP
2010
ACM
16 years 4 months ago
2010
ACM
This poster is a case study on the application of a novel programming model, called Concurrent Collections (CnC), to the implementation of an asynchronous-parallel algorithm for c...