Sciweavers

5302 search results - page 69 / 1061
» Learning How to Separate
Sort
View
ECML
2005
Springer
15 years 5 months ago
Margin-Sparsity Trade-Off for the Set Covering Machine
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 ...
François Laviolette, Mario Marchand, Mohak ...
COLT
2003
Springer
15 years 5 months ago
Preference Elicitation and Query Learning
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...
ICALT
2006
IEEE
15 years 6 months ago
Building Learning Networks for Lifelong Learners: Challenges, Models, Technologies and Standards
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...
Rob Koper
ACMACE
2006
ACM
15 years 5 months ago
How real should virtual characters be?
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...
CORR
2011
Springer
168views Education» more  CORR 2011»
14 years 3 months ago
Link Prediction by De-anonymization: How We Won the Kaggle Social Network Challenge
— 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...