2434 search results - page 443 / 487 » Algorithmic Randomness of Closed Sets |
SBIA
2004
Springer
15 years 5 months ago
2004
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...
121
Voted
ASIAN
1999
Springer
15 years 4 months ago
1999
Springer
Abstract. Ant Colony Optimization (ACO) is a paradigm that employs a set of cooperating agents to solve functions or obtain good solutions for combinatorial optimization problems. ...
153
Voted
ESA
2010
Springer
15 years 1 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...
119
click to vote
CORR
2010
Springer
15 years 16 days ago
2010
Springer
Abstract. We present the discrete beeping communication model, which assumes nodes have minimal knowledge about their environment and severely limited communication capabilities. S...
129
click to vote
PVLDB
2010
14 years 11 months ago
2010
Recently, there has been increasing interest in extending relational query processing to include data obtained from unstructured sources. A common approach is to use stand-alone I...