757 search results - page 73 / 152 » On the hardness of approximating Max-Satisfy |
111
click to vote
SIGECOM
2010
ACM
15 years 2 months ago
2010
ACM
The existing literature on optimal auctions focuses on optimizing the expected revenue of the seller, and is appropriate for risk-neutral sellers. In this paper, we identify good ...
ICALP
2010
Springer
15 years 2 months ago
2010
Springer
Computing a minimum vertex cover in graphs and hypergraphs is a well-studied optimizaton problem. While intractable in general, it is well known that on bipartite graphs, vertex c...
PODS
2012
ACM
13 years 9 days ago
2012
ACM
We study the mergeability of data summaries. Informally speaking, mergeability requires that, given two summaries on two data sets, there is a way to merge the two summaries into ...
CIVR
2009
Springer
15 years 4 months ago
2009
Springer
The Bag of Visual Words (BoV) paradigm has successfully been applied to image content analysis tasks such as image classification and object detection. The basic BoV approach ove...
ECRTS
2005
IEEE
15 years 3 months ago
2005
IEEE
We consider the use of the earliest-deadline-first (EDF) scheduling algorithm in soft real-time multiprocessor systems. In hard real-time systems, a significant disparity exists...