588 search results - page 24 / 118 » Reducibility and Completeness in Private Computations |
106
Voted
IOR
2008
15 years 17 days ago
2008
We study the important problem of how a supplier should optimally share the consequences of demand uncertainty (i.e., the cost of inventory excesses and shortages) with a retailer...
102
click to vote
CCGRID
2006
IEEE
15 years 6 months ago
2006
IEEE
As the scale of cluster computing grows, it is becoming hard for long-running applications to complete without facing failures on large-scale clusters. To address this issue, chec...
111
click to vote
EUROPAR
2009
Springer
15 years 4 months ago
2009
Springer
The Cell Broadband Engine (Cell BE) is a heterogeneous multi-core processor specifically designed to exploit thread-level parallelism. Its memory model comprehends a common shared ...
143
Voted
COMBINATORICA
2011
14 years 12 days ago
2011
We prove several quantitative Ramseyan results involving ternary complete trees with {0, 1}-labeled edges where we attempt to find a complete binary subtree with as few labels as ...
90
Voted
IWCMC
2006
ACM
15 years 6 months ago
2006
ACM
The primary performance objective of a broadcast scheme in an ad-hoc wireless network is to reduce the total number of retransmissions needed to reach all nodes. Another (less app...