3897 search results - page 104 / 780 » complexity 2010 |
PKDD
2010
Springer
13 years 8 months ago
2010
Springer
Active learning [1] is a branch of Machine Learning in which the learning algorithm, instead of being directly provided with pairs of problem instances and their solutions (their l...
WABI
2010
Springer
13 years 8 months ago
2010
Springer
Abstract. A recursive algorithm by Aho, Sagiv, Szymanski, and Ullman [1] forms the basis for many modern rooted supertree methods employed in Phylogenetics. However, as observed by...
TCC
2010
Springer
14 years 7 months ago
2010
Springer
Learning is a task that generalizes many of the analyses that are applied to collections of data, and in particular, collections of sensitive individual information. Hence, it is n...
COCO
2010
Springer
14 years 2 months ago
2010
Springer
Abstract—We consider two natural extensions of the communication complexity model that are inspired by distributed computing. In both models, two parties are equipped with synchr...
FUN
2010
Springer
14 years 3 months ago
2010
Springer
Abstract. We analyze the computational complexity of various twodimensional platform games. We identify common properties of these games that allow us to state several meta-theorem...