14165 search results - page 688 / 2833 » The generalized two-server problem |
199
click to vote
ICIP
2002
IEEE
16 years 9 months ago
2002
IEEE
In this paper, we address the issue of joint space-time segmentation of image sequences. Typical approaches to such segmentation consider two image frames at a time, and perform t...
210
Voted
DAC
2002
ACM
16 years 8 months ago
2002
ACM
A central problem in functional verification is to check that a circuit block is producing correct outputs while enforcing that the environment is providing legal inputs. To attac...
195
Voted
KDD
2008
ACM
16 years 7 months ago
2008
ACM
How can a search engine automatically provide the best and most appropriate title for a result URL (link-title) so that users will be persuaded to click on the URL? We consider th...
246
click to vote
STOC
2004
ACM
16 years 7 months ago
2004
ACM
Abstract. In the late nineties, Erickson proved a remarkable lower bound on the decision tree complexity of one of the central problems of computational geometry: given n numbers, ...
175
click to vote
STOC
2003
ACM
16 years 7 months 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,...