72 search results - page 9 / 15 » stoc 2003 |
215
click to vote
STOC
2003
ACM
16 years 6 days ago
2003
ACM
In dynamic stabbing, we operate on a dynamic set of intervals. A stabbing query asks for an interval containing a given point. This basic problem encodes problems such as method l...
STOC
2003
ACM
16 years 6 days ago
2003
ACM
We construct binary codes for fingerprinting. Our codes for n users that are -secure against c pirates have length O(c2 log(n/ )). This improves the codes proposed by Boneh and Sh...
STOC
2003
ACM
16 years 6 days ago
2003
ACM
In this paper, we present the first average-case analysis proving an expected polynomial running time for an exact algorithm for the 0/1 knapsack problem. In particular, we prove,...
STOC
2003
ACM
16 years 6 days ago
2003
ACM
We study clustering problems in the streaming model, where the goal is to cluster a set of points by making one pass (or a few passes) over the data using a small amount of storag...
102
click to vote
STOC
2003
ACM
16 years 6 days ago
2003
ACM
In this paper, we show that any n point metric space can be embedded into a distribution over dominating tree metrics such that the expected stretch of any edge is O(log n). This ...