430 search results - page 17 / 86 » On Using Satisfiability-Based Pruning Techniques in Covering... |
ICIP
2005
IEEE
16 years 1 days ago
2005
IEEE
Dirty paper trellis codes are a form of watermarking with side information. These codes have the advantage of being invariant to valumetric scaling of the cover Work. However, the...
CORR
2010
Springer
14 years 7 months ago
2010
Springer
We introduce a new technique for proving kernelization lower bounds, called cross-composition. A classical problem L cross-composes into a parameterized problem Q if an instance o...
SIGSOFT
2010
ACM
14 years 8 months ago
2010
ACM
Test suite augmentation techniques are used in regression testing to identify code elements affected by changes and to generate test cases to cover those elements. Our preliminary...
HEURISTICS
2006
14 years 10 months ago
2006
Multiobjective optimization deals with problems involving multiple measures of performance that should be optimized simultaneously. In this paper we extend bucket elimination (BE),...
PKDD
2007
Springer
15 years 4 months ago
2007
Springer
Nearest neighbour search (NNS) is an old problem that is of practical importance in a number of fields. It involves finding, for a given point q, called the query, one or more po...