1578 search results - page 258 / 316 » Algorithmic randomness of continuous functions |
ICML
2008
IEEE
14 years 9 months ago
2008
IEEE
The problem of obtaining the maximum a posteriori (map) estimate of a discrete random field is of fundamental importance in many areas of Computer Science. In this work, we build ...
CVPR
2010
IEEE
14 years 4 months ago
2010
IEEE
Seeded image segmentation is a popular type of supervised image segmentation in computer vision and image processing. Previous methods of seeded image segmentation treat the image...
CRYPTO
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. Secure multiparty computation allows a group of distrusting parties to jointly compute a (possibly randomized) function of their inputs. However, it is often the case tha...
ENC
2005
IEEE
14 years 2 months ago
2005
IEEE
Generally, evolutionary algorithms require a large number of evaluations of the objective function in order to obtain a good solution. This paper presents a simple approach to sav...
ADMA
2006
Springer
14 years 14 days ago
2006
Springer
Abstract. Most of the work in Machine Learning assume that examples are generated at random according to some stationary probability distribution. In this work we study the problem...