565 search results - page 112 / 113 » Geometry of Upper Probabilities |
FOCS
2002
IEEE
13 years 9 months ago
2002
IEEE
Two decades ago, Megiddo and Dyer showed that linear programming in two and three dimensions (and subsequently any constant number of dimensions) can be solved in linear time. In ...
SWAT
2000
Springer
13 years 8 months ago
2000
Springer
Planar point location is among the most fundamental search problems in computational geometry. Although this problem has been heavily studied from the perspective of worst-case que...
FOCS
1991
IEEE
13 years 8 months ago
1991
IEEE
We wish to increase the power of an arbitrary algorithm designed for non-degenerate input, by allowing it to execute on all inputs. We concentrate on in nitesimal symbolic perturba...
3DIM
2005
IEEE
13 years 6 months ago
2005
IEEE
Camera calibration methods, whether implicit or explicit, are a critical part of most 3D vision systems. These methods involve estimation of a model for the camera that produced t...
JCB
2002
13 years 4 months ago
2002
For small samples, classi er design algorithms typically suffer from over tting. Given a set of features, a classi er must be designed and its error estimated. For small samples, ...