5372 search results - page 421 / 1075 » complexity 2007 |
144
click to vote
ICIP
2007
IEEE
16 years 8 months ago
2007
IEEE
Finding the sparsest approximation of an image as a sum of basis functions drawn from a redundant dictionary is an NPhard problem. In the case of a dictionary whose elements form ...
169
click to vote
COCOA
2007
Springer
16 years 29 days ago
2007
Springer
We define a fundamental domain for a linear programming relaxation of a combinatorial integer program which is symmetric under a group action. We then describe a straightforward w...
307
click to vote
WSC
2007
15 years 9 months ago
2007
Planning, scheduling and effective management of contingencies are crucial for the successful management of construction projects. In this paper we explore a mathematical represen...
203
click to vote
ICCV
2007
IEEE
16 years 8 months ago
2007
IEEE
Recognition of 3D objects from different viewpoints is a difficult problem. In this paper, we propose a new method to recognize 3D range images by matching local surface descripto...
199
click to vote
ICC
2007
IEEE
16 years 1 months ago
2007
IEEE
—We address the problem of distributed source coding of binary sources with side information at the decoder. We propose a compression scheme using irregular turbo codes. We optim...