2356 search results - page 107 / 472 » Characterizations of postman sets |
108
Voted
COMPGEOM
2010
ACM
15 years 9 months ago
2010
ACM
We characterize the set of all pairs (a, b) such that for every set P of n points in general position in R2 there always exists a point p ∈ P and two opposite quadrants determin...
156
click to vote
ECCV
2000
Springer
15 years 8 months ago
2000
Springer
A new approach to characterizing the performance of point-correspondence algorithms is presented. Instead of relying on any \ground truth', it uses the self-consistency of th...
127
click to vote
COLT
2006
Springer
15 years 8 months ago
2006
Springer
We study functions with multiple output values, and use active sampling to identify an example for each of the possible output values. Our results for this setting include: (1) Eff...
118
click to vote
AIPS
2000
15 years 5 months ago
2000
The paper takes a fresh look at algorithms for maximizing expected utility over a set of policies, that is, a set of possible ways of reacting to observations about an uncertain s...
APAL
2010
15 years 4 months ago
2010
A real x is 1 1-Kurtz random (1 1-Kurtz random) if it is in no closed null 1 1 set (1 1 set). We show that there is a cone of 1 1-Kurtz random hyperdegrees. We characterize lowness...