This paper considers the precedence constrained knapsack problem. More speci cally, we are interested in classes of valid inequalities which are facet-de ning for the precedence constrained knapsack polytope. We study the complexity of obtaining these facets using the standard sequential lifting procedure. Applying this procedure requires solving a combinatorial problem. For valid inequalities ...

We introduce a mechanism called lifting to share predicates between the two components of a dl-program, integrating them in a tighter way. Using lifting, one can reason about the predicates being shared both via the description logic knowledge base and via Datalogstyle rules, and the deductions one makes are automatically reflected globally on both components. This is a capability not directly ...

The Paper Adaptive Nonseparable Wavelet Transform via Lifting and its Application to Content-Based Image Retrieval. Adapt a multidimensional wavelet filter bank, based on the nonseparable lifting scheme framework. The lifting scheme there are two linear filter denoted P (prediction) and U ( update) are defined as Neville filters of order N and N ~ , respectively. We are applying the Haar wavele...

This paper investigates the use of generalized lifting to increase the sparseness of wavelet decompositions with application to image representation and coding. As in the bandelet approach, the strategy consists in applying first a separable wavelet decomposition and then in processing the details subbands to further decorrelate the signal representation. For this second step, we use a generali...