1578 search results - page 2 / 316 » Algorithmic randomness of continuous functions |
ISCIS
2003
Springer
14 years 19 days ago
2003
Springer
In this paper, we study an adaptive random search method based on continuous action-set learning automaton for solving stochastic optimization problems in which only the noisecorr...
ICPR
2010
IEEE
14 years 2 months ago
2010
IEEE
Many vision applications have been formulated as Markov Random Field (MRF) problems. Although many of them are discrete labeling problems, continuous formulation often achieves gre...
CIKM
2009
Springer
14 years 2 months ago
2009
Springer
This paper addresses the issue of social recommendation based on collaborative filtering (CF) algorithms. Social recommendation emphasizes utilizing various attributes informatio...
ESA
2010
Springer
13 years 8 months ago
2010
Springer
We study the problem of estimating the average of a Lipschitz continuous function f defined over a metric space, by querying f at only a single point. More specifically, we explore...
ICMLA
2007
13 years 9 months ago
2007
Dynamic programming is introduced to quantize a continuous random variable into a discrete random variable. Quantization is often useful before statistical analysis or reconstruct...