Exact and approximate solutions to the multisource weber problem
β Scribed by Robert E. Kuenne; Richard M. Soland
- Publisher
- Springer-Verlag
- Year
- 1972
- Tongue
- English
- Weight
- 898 KB
- Volume
- 3-3
- Category
- Article
- ISSN
- 0025-5610
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
We consider the problem how big is the set of solutions of a given functional equation in the set of approximate solutions. It happens that in the cases of linear functional equations (like Cauchy, Jensen) or linear inequalities (like convex, Jensen convex) the sets of solutions are very small subse
In this paper we study the problem of computing an exact, or arbitrarily close to exact, solution of an unrestricted point set stereo matching problem. Within the context of classical approaches like the Marr-Poggio algorithm, this means that we study how to solve the unrestricted basic subproblems