3874 search results - page 631 / 775 » Approximation Algorithms for k-hurdle Problems |
151
Voted
COCO
2003
Springer
15 years 9 months 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 ...
130
Voted
STOC
2010
ACM
15 years 8 months ago
2010
ACM
We study the classic mathematical economics problem of Bayesian optimal mechanism design where a principal aims to optimize expected revenue when allocating resources to self-inte...
119
click to vote
VLDB
2001
ACM
15 years 8 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. ...
189
Voted
FOCS
2000
IEEE
15 years 8 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...
148
click to vote
STOC
2000
ACM
15 years 8 months ago
2000
ACM
Multiple sequence alignment is a fundamental problem in computational biology. Because of its notorious difficulties, aligning sequences within a constant band (c-diagonal) is a ...