We propose a new learning algorithm for the set covering machine and a tight data-compression risk bound that the learner can use for choosing the appropriate tradeoff between the ...
Abstract. In this paper we initiate an exploration of relationships between “preference elicitation”, a learning-style problem that arises in combinatorial auctions, and the pr...
Avrim Blum, Jeffrey C. Jackson, Tuomas Sandholm, M...
In this tutorial five key problems are discussed that occur in the area of lifelong learning. For each problem we will look at the possible technological solutions. The five probl...
In recent years 3D virtual characters have become more common in desktop interfaces, particularly in gaming and entertainment applications. In this paper we describe how augmented...
Daniel Wagner, Mark Billinghurst, Dieter Schmalsti...
— This paper describes the winning entry to the IJCNN 2011 Social Network Challenge run by Kaggle.com. The goal of the contest was to promote research on realworld link predictio...
Arvind Narayanan, Elaine Shi, Benjamin I. P. Rubin...