7 search results - page 2 / 2 » Approximation Algorithms for 3D Orthogonal Knapsack |
IVC
2007
13 years 4 months ago
2007
We consider simple cube-curves in the orthogonal 3D grid of cells. The union of all cells contained in such a curve (also called the tube of this curve) is a polyhedrally bounded s...
ICA
2012
Springer
12 years 13 days ago
2012
Springer
A novel tensor decomposition called pattern or P-decomposition is proposed to make it possible to identify replicating structures in complex data, such as textures and patterns in ...