2976 search results - page 235 / 596 » On the bounded integer programming |
255
click to vote
COMPSYSTECH
2011
14 years 6 months ago
2011
Abstract. In a software watermarking environment, several graph theoretic watermark methods encode the watermark values as graph structures and embed them in application programs. ...
155
click to vote
CVPR
2007
IEEE
16 years 8 months ago
2007
IEEE
In this paper we introduce two new methods for solving binary quadratic problems. While spectral relaxation methods have been the workhorse subroutine for a wide variety of comput...
162
click to vote
ISQED
2007
IEEE
16 years 13 days ago
2007
IEEE
In nanometer regime, the effects of variations are having an increasing impact on the delay and power characteristics of devices as well as the yield of the circuit. Statistical t...
178
click to vote
FUIN
2000
15 years 6 months ago
2000
We give algorithms to construct the least L-model for a given positive modal logic program P, where L can be one of the modal logics KD, T, KDB, B, KD4, S4, KD5, KD45, and S5. If L...
174
click to vote
PAMI
2007
15 years 5 months ago
2007
A new framework is presented for both understanding and developing graph-cut based combinatorial algorithms suitable for the approximate optimization of a very wide class of MRFs ...