393 search results - page 70 / 79 » Approximation Algorithm for Directed Telephone Multicast Pro... |
COCO
2003
Springer
14 years 18 days ago
2003
Springer
We study the communication complexity of the set disjointness problem in the general multi-party model. For t players, each holding a subset of a universe of size n, we establish ...
FOCS
2000
IEEE
13 years 11 months ago
2000
IEEE
In this article, we show several results obtained by combining the use of stable distributions with pseudorandom generators for bounded space. In particular: —We show that, for a...
VLDB
2001
ACM
13 years 11 months ago
2001
ACM
This paper investigates the problem of incremental joins of multiple ranked data sets when the join condition is a list of arbitrary user-defined predicates on the input tuples. ...
FOCS
2009
IEEE
14 years 2 months ago
2009
IEEE
We consider the Item Pricing problem for revenue maximization in the limited supply setting, where a single seller with n items caters to m buyers with unknown subadditive valuati...
SIGMOD
2009
ACM
14 years 7 months ago
2009
ACM
We consider the problem of collectively approximating a set of sensor signals using the least amount of space so that any individual signal can be efficiently reconstructed within...