53 search results - page 3 / 11 » Computing Lower Expectations with Kuznetsov's Independence C... |
151
click to vote
SODA
2010
ACM
16 years 3 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...
135
click to vote
FOCS
2008
IEEE
16 years 10 days 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. â€...
145
click to vote
ICPR
2008
IEEE
16 years 10 days 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...
151
click to vote
FOCS
2005
IEEE
15 years 11 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...
162
click to vote
ICML
2005
IEEE
16 years 6 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...