757 search results - page 44 / 152 » On the hardness of approximating Max-Satisfy |
SODA
2012
ACM
13 years 12 days ago
2012
ACM
The Densest k-subgraph problem (i.e. find a size k subgraph with maximum number of edges), is one of the notorious problems in approximation algorithms. There is a significant g...
CRYPTO
2009
Springer
15 years 4 months ago
2009
Springer
We prove the equivalence, up to a small polynomial approximation factor n/ log n, of the lattice problems uSVP (unique Shortest Vector Problem), BDD (Bounded Distance Decoding) and...
WINE
2009
Springer
15 years 2 months ago
2009
Springer
We consider the complexity of decision making with regards to predatory pricing in multimarket oligopoly models. Specifically, we present multimarket extensions of the classical s...
111
click to vote
RTAS
2007
IEEE
15 years 4 months ago
2007
IEEE
Multiprocessor platforms have been widely adopted in both embedded and server systems. In addition to the performance improvement, multiprocessor systems could have the flexibili...
CVPR
2003
IEEE
15 years 12 months ago
2003
IEEE
This work explores a statistical basis for a process often described in computer vision: image segmentation by region merging following a particular order in the choice of regions...