100 search results - page 4 / 20 » A New Filtering Based on Decomposition of Constraint Sub-Net... |
CPAIOR
2006
Springer
13 years 11 months ago
2006
Springer
We show that various duals that occur in optimization and constraint satisfaction can be classified as inference duals, relaxation duals, or both. We discuss linear programming, su...
MTA
2011
13 years 2 months ago
2011
Quantization index modulation is one of the best methods for performing blind watermarking, due to its simplicity and good rate-distortion-robustness tradeoffs. In this paper, a ne...
TSP
2008
13 years 7 months ago
2008
A new framework for designing robust adaptive filters is introduced. It is based on the optimization of a certain cost function subject to a time-dependent constraint on the norm o...
ACL
2001
13 years 8 months ago
2001
We describe a new framework for dependency grammar, with a modular decomposition of immediate dependency and linear precedence. Our approach distinguishes two orthogonal yet mutua...
AAAI
1994
13 years 8 months ago
1994
Many real-life Constraint Satisfaction Problems (CSPs) involve some constraints similar to the alldifferent constraints. These constraints are called constraints of difference. Th...