1274 search results - page 137 / 255 » The Geometry of Coin-Weighing Problems |
100
click to vote
EVOW
2001
Springer
15 years 5 months ago
2001
Springer
Abstract. This work describes the use of genetic algorithms for automating the photogrammetric network design process. When planning a photogrammetric network, the cameras should b...
96
Voted
ECCV
2000
Springer
15 years 5 months ago
2000
Springer
We describe in this paper closed-form solutions to the following problems in multi-view geometry of n'th order curves: i recovery of the fundamental matrix from 4 or more c...
153
Voted
STOC
1999
ACM
15 years 5 months ago
1999
ACM
Motivated by Ajtai’s worst-case to average-case reduction for lattice problems, we study the complexity of computing short linearly independent vectors (short basis) in a lattic...
100
Voted
CORR
2002
Springer
15 years 19 days ago
2002
Springer
We consider the problem of cutting a subset of the edges of a polyhedral manifold surface, possibly with boundary, to obtain a single topological disk, minimizing either the total...
87
Voted
ENTCS
2002
15 years 19 days ago
2002
Most problems in computational geometry are algebraic. A general approach to address nonrobustness in such problems is Exact Geometric Computation (EGC). There are now general lib...