1554 search results - page 179 / 311 » Parameterized Complexity and Approximation Algorithms |
110
click to vote
COCO
2005
Springer
15 years 8 months ago
2005
Springer
We study the complexity of approximating Max NME3SAT, a variant of Max 3SAT when the instances are guaranteed to not have any mixed clauses, i.e., every clause has either all its ...
155
Voted
CVPR
2011
IEEE
14 years 11 months ago
2011
IEEE
Nearly every structured prediction problem in computer vision requires approximate inference due to large and complex dependencies among output labels. While graphical models prov...
130
click to vote
STOC
2004
ACM
16 years 3 months ago
2004
ACM
In this paper we present a sublinear time (1+ )-approximation randomized algorithm to estimate the weight of the minimum spanning tree of an n-point metric space. The running time...
128
click to vote
ICMCS
2008
IEEE
15 years 9 months ago
2008
IEEE
In this paper, we derive an analytical model for the evaluation of the performance of a Video on Demand (VoD) system. The model estimates the mean waiting time achievable by the P...
131
click to vote
CISC
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. This paper reports on the improved and multiple linear cryptanalysis of reduced round Serpent by mean of a branch-and-bound characteristic search within the algorithm. We...