1469 search results - page 158 / 294 » Approximate polynomial decomposition |
166
click to vote
IFIP
2004
Springer
15 years 11 months ago
2004
Springer
We study the general packing problem with M constraints. In [Jansen and Zhang, TCS 2002] a c(1 + ε)-approximation algorithm for the general packing problem was proposed. A block s...
145
click to vote
AMDO
2004
Springer
15 years 11 months ago
2004
Springer
In this paper, a method for image deformation is presented. It is based upon decomposition of the deformation problem into basic physical laws. Unlike other methods that solve a di...
182
click to vote
CIARP
2004
Springer
15 years 11 months ago
2004
Springer
Geometric moments have been proven to be a very efficient tool for description and recognition of binary shapes. Numerous methods for effective calculation of image moments have be...
166
click to vote
CIA
2008
Springer
15 years 8 months ago
2008
Springer
This paper presents a specific contracting algorithm that contributes to the process of distributed planning and resource allocation in competitive, semi-trusted environments. The ...
158
Voted
DICTA
2003
15 years 7 months ago
2003
In this paper we review a number of approaches to reducing, or removing, the problem of shift variance in the discrete wavelet transform (DWT). We describe a generalization of the ...