Sciweavers

2182 search results - page 314 / 437
» A Robust Algorithm for Solving Nonlinear Programming Problem...
Sort
View
133
Voted
IPPS
2010
IEEE
15 years 9 days ago
Large neighborhood local search optimization on graphics processing units
Local search (LS) algorithms are among the most powerful techniques for solving computationally hard problems in combinatorial optimization. These algorithms could be viewed as &q...
Thé Van Luong, Nouredine Melab, El-Ghazali ...
COMGEO
2006
ACM
15 years 2 months ago
Inner and outer rounding of Boolean operations on lattice polygonal regions
Robustness problems due to the substitution of the exact computation on real numbers by the rounded floating point arithmetic are often an obstacle to obtain practical implementat...
Olivier Devillers, Philippe Guigue
130
Voted
LCPC
1997
Springer
15 years 6 months ago
Automatic Data Decomposition for Message-Passing Machines
The data distribution problem is very complex, because it involves trade-offdecisions between minimizing communication and maximizing parallelism. A common approach towards solving...
Mirela Damian-Iordache, Sriram V. Pemmaraju
107
Voted
ICPR
2004
IEEE
16 years 3 months ago
Reconstruction of Medical Images by Perspective Shape-from-Shading
Shape-from-Shading (SfS) is a fundamental problem in Computer Vision; it is based upon the image irradiance equation. Recently, the authors proposed to solve the image irradiance ...
Ariel Tankus, Nir A. Sochen, Yehezkel Yeshurun
102
Voted
CVPR
2010
IEEE
15 years 10 months ago
Towards Internet-scale Multi-view Stereo
This paper introduces an approach for enabling existing multi-view stereo methods to operate on extremely large unstructured photo collections. The main idea is to decompose the c...
Yasutaka Furukawa, Steve Seitz, Richard Szeliski