53 search results - page 3 / 11 » Computing Lower Expectations with Kuznetsov's Independence C... |
SODA
2010
ACM
14 years 5 months ago
2010
ACM
We describe an algorithm for computing planar convex hulls in the self-improving model: given a sequence I1, I2, . . . of planar n-point sets, the upper convex hull conv(I) of eac...
FOCS
2008
IEEE
14 years 2 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. â€...
ICPR
2008
IEEE
14 years 2 months ago
2008
IEEE
In semi-supervised clustering, domain knowledge can be converted to constraints and used to guide the clustering. In this paper we propose a feature selection algorithm for semi-s...
FOCS
2005
IEEE
14 years 1 months ago
2005
IEEE
We consider the problem of learning mixtures of arbitrary symmetric distributions. We formulate sufficient separation conditions and present a learning algorithm with provable gua...
ICML
2005
IEEE
14 years 8 months ago
2005
IEEE
Many real-world domains exhibit rich relational structure and stochasticity and motivate the development of models that combine predicate logic with probabilities. These models de...