429 search results - page 38 / 86 » Improved Algorithms for the k Maximum-Sums Problems |
119
click to vote
ICDT
2011
ACM
14 years 1 months ago
2011
ACM
Given a set of points with uncertain locations, we consider the problem of computing the probability of each point lying on the skyline, that is, the probability that it is not do...
FOCS
2008
IEEE
15 years 4 months ago
2008
IEEE
We use a Bayesian approach to optimally solve problems in noisy binary search. We deal with two variants: • Each comparison is erroneous with independent probability 1 − p. ...
SODA
2010
ACM
15 years 7 months ago
2010
ACM
If a two-player social welfare maximization problem does not admit a PTAS, we prove that any maximal-in-range truthful mechanism that runs in polynomial time cannot achieve an app...
SODA
1997
ACM
14 years 11 months ago
1997
ACM
We study graph partitioning problems on graphs with edge capacities and vertex weights. The problems of b-balanced cuts and k-balanced partitions are unified into a new problem ca...
111
click to vote
SEMCO
2008
IEEE
15 years 4 months ago
2008
IEEE
In this paper, we consider a sentiment regression problem: summarizing the overall sentiment of a review with a real-valued score. Empirical results on a set of labeled reviews sh...