630 search results - page 11 / 126 » Hardness results for approximating the bandwidth |
152
click to vote
ICCV
2005
IEEE
15 years 11 months ago
2005
IEEE
We derive the clustering problem from first principles showing that the goal of achieving a probabilistic, or ”hard”, multi class clustering result is equivalent to the algeb...
194
click to vote
AVSS
2006
IEEE
16 years 4 days ago
2006
IEEE
This paper presents the implementation of a video segmentation unit used for embedded automated video surveillance systems. Various aspects of the underlying segmentation algorith...
173
click to vote
SODA
2012
ACM
13 years 8 months ago
2012
ACM
Consider the problem of pricing n items under an unlimited supply with m buyers. Each buyer is interested in a bundle of at most k of the items. These buyers are single minded, wh...
169
click to vote
IANDC
2007
15 years 6 months ago
2007
In the past decade, there has been a stream of work in designing approximation schemes for dense instances of NP-Hard problems. These include the work of Arora, Karger and Karpins...
151
click to vote
STOC
2009
ACM
16 years 6 months ago
2009
ACM
In this paper we study a fundamental open problem in the area of probabilistic checkable proofs: What is the smallest s such that NP naPCP1,s[O(log n), 3]? In the language of har...