4066 search results - page 247 / 814 » Almost Complete Sets |
166
click to vote
SC
2003
ACM
15 years 12 months ago
2003
ACM
We investigate runtime strategies for data-intensive applications that involve generalized reductions on large, distributed datasets. Our set of strategies includes replicated fi...
159
click to vote
SPAA
2003
ACM
15 years 12 months ago
2003
ACM
We develop an algorithm for parallel disk sorting, whose I/O cost approaches the lower bound and that guarantees almost perfect overlap between I/O and computation. Previous algor...
157
click to vote
CC
2003
Springer
15 years 11 months ago
2003
Springer
We have developed Tm, a template-based metacompiler. Given a set of data-structure definitions and a template, Tm generates files that instantiate the template for the given data...
163
click to vote
FOCS
2002
IEEE
15 years 11 months ago
2002
IEEE
We consider the problem of sampling almost uniformly from the set of contingency tables with given row and column sums, when the number of rows is a constant. Cryan and Dyer [3] h...
220
click to vote
METRICS
2002
IEEE
15 years 11 months ago
2002
IEEE
Process assessment or process improvement is usually not considered in the context of Web applications, and the differences between Web applications and traditional applications a...