872 search results - page 51 / 175 » Extreme lower probabilities |
151
click to vote
FOCS
2008
IEEE
16 years 1 months ago
2008
IEEE
We use a Bayesian approach to optimally solve problems in noisy binary search. We deal with two variants: • Each comparison is erroneous with independent probability 1 − p. ...
190
click to vote
ICDCS
2008
IEEE
16 years 1 months ago
2008
IEEE
— Relative neighborhood graph (RNG) has been widely used in topology control and geographic routing in wireless ad hoc networks. Its maximum edge length is the minimum requiremen...
173
Voted
FSTTCS
2004
Springer
16 years 2 days ago
2004
Springer
We consider the problem of determining whether a given set S in Rn is approximately convex, i.e., if there is a convex set K ∈ Rn such that the volume of their symmetric differe...
175
click to vote
CPM
2008
Springer
15 years 8 months ago
2008
Springer
We introduce a new dimension to the widely studied on-line approximate string matching problem, by introducing an error threshold parameter so that the algorithm is allowed to mis...
145
click to vote
NIPS
2007
15 years 8 months ago
2007
In this paper we formulate a novel AND/OR graph representation capable of describing the different configurations of deformable articulated objects such as horses. The representa...