Sciweavers

3352 search results - page 176 / 671
» Hierarchical Problem Solving and the Bayesian Optimization A...
Sort
View
SCALESPACE
2009
Springer
16 years 28 days ago
On Level-Set Type Methods for Recovering Piecewise Constant Solutions of Ill-Posed Problems
We propose a regularization method for solving ill-posed problems, under the assumption that the solutions are piecewise constant functions with unknown level sets and unknown leve...
Adriano DeCezaro, Antonio Leitão, Xue-Cheng...
ICCV
1998
IEEE
15 years 10 months ago
A Maximum-Flow Formulation of the N-Camera Stereo Correspondence Problem
This paper describes a new algorithm for solving the N-camera stereo correspondence problem by transforming it into a maximum- ow problem. Once solved, the minimum-cut associated ...
Sébastien Roy, Ingemar J. Cox
AI
1998
Springer
15 years 6 months ago
A Complete Anytime Algorithm for Number Partitioning
Given a set of numbers, the two-way partitioning problem is to divide them into two subsets, so that the sum of the numbers in each subset are as nearly equal as possible. The pro...
Richard E. Korf
ALGORITHMICA
2010
75views more  ALGORITHMICA 2010»
15 years 6 months ago
In-Place Algorithms for Computing (Layers of) Maxima
We describe space-efficient algorithms for solving problems related to finding maxima among points in two and three dimensions. Our algorithms run in optimal O(n log n) time and oc...
Henrik Blunck, Jan Vahrenhold
EOR
2007
87views more  EOR 2007»
15 years 6 months ago
An optimal and scalable parallelization of the two-list
In this paper, we suggest a parallel algorithm based on a shared memory SIMD architecture for solving an n item subset-sum problem in time O(2n/2 /p) by using p = 2q processors, 0...
Carlos Alberto Alonso Sanches, Nei Yoshihiro Soma,...