699 search results - page 20 / 140 » The method of combinatorial telescoping |
STOC
2007
ACM
14 years 8 months ago
2007
ACM
Semidefinite programs (SDP) have been used in many recent approximation algorithms. We develop a general primal-dual approach to solve SDPs using a generalization of the well-know...
MFCS
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. We introduce a new general polynomial-time constructionthe fibre construction- which reduces any constraint satisfaction problem CSP(H) to the constraint satisfaction pr...
AAECC
2006
Springer
14 years 2 months ago
2006
Springer
This paper addresses the problem of threshold traitor tracing for digital content where, by embedding appropriate digital patterns into the distributed content, it is possible to t...
EXPCS
2007
14 years 10 days ago
2007
Combinatorial optimization problems expressed as Boolean constraint satisfaction problems (BCSPs) arise in several contexts, ranging from the classical unate set-packing problems ...
CEC
2009
IEEE
13 years 6 months ago
2009
IEEE
-- Most optimization algorithms that use probabilistic models focus on extracting the information from good solutions found in the population. A selection method discards the below...