Sciweavers

6315 search results - page 72 / 1263
» Approximating Solution Structure
Sort
View
FOCS
2006
IEEE
15 years 7 months ago
Improved approximation algorithms for multidimensional bin packing problems
In this paper we introduce a new general framework for set covering problems, based on the combination of randomized rounding of the (near-)optimal solution of the Linear Programm...
Nikhil Bansal, Alberto Caprara, Maxim Sviridenko
89
Voted
CVPR
2003
IEEE
16 years 3 months ago
An Efficient Solution to the Five-Point Relative Pose Problem
An efficient algorithmic solution to the classical five-point relative pose problem is presented. The problem is to find the possible solutions for relative camera motion between ...
David Nistér
104
Voted
PARA
1995
Springer
15 years 4 months ago
Decomposing Linear Programs for Parallel Solution
Coarse grain parallelism inherent in the solution of Linear Programming (LP) problems with block angular constraint matrices has been exploited in recent research works. However, t...
Ali Pinar, Ümit V. Çatalyürek, Ce...
117
Voted
DOCENG
2008
ACM
15 years 2 months ago
Keeping a digital library clean: new solutions to old problems
Digital Libraries are complex information systems that involve rich sets of digital objects and their respective metadata, along with multiple organizational structures and servic...
Alberto H. F. Laender, Marcos André Gon&cce...
138
Voted
IJCV
2010
167views more  IJCV 2010»
14 years 8 months ago
A Solution of the Dichromatic Model for Multispectral Photometric Invariance
In this paper, we address the problem of photometric invariance in multispectral imaging making use of an optimisation approach based upon the dichromatic model. In this manner, w...
Cong Phuoc Huynh, Antonio Robles-Kelly