Sciweavers

388 search results - page 50 / 78
» The covering number in learning theory
Sort
View
ECML
1993
Springer
13 years 11 months ago
Complexity Dimensions and Learnability
In machine learning theory, problem classes are distinguished because of di erences in complexity. In 6 , a stochastic model of learning from examples was introduced. This PAClear...
Shan-Hwei Nienhuys-Cheng, Mark Polman
P2P
2008
IEEE
102views Communications» more  P2P 2008»
14 years 1 months ago
Free-Riding, Fairness, and Firewalls in P2P File-Sharing
Peer-to-peer file-sharing networks depend on peers uploading data to each other. Some peers, called free-riders, will not upload data unless there is an incentive to do so. Algor...
Jacob Jan-David Mol, Johan A. Pouwelse, Dick H. J....
ALT
2000
Springer
13 years 11 months ago
On the Hardness of Learning Acyclic Conjunctive Queries
A conjunctive query problem in relational database theory is a problem to determine whether or not a tuple belongs to the answer of a conjunctive query over a database. Here, a tup...
Kouichi Hirata
VIS
2009
IEEE
399views Visualization» more  VIS 2009»
14 years 8 months ago
Visual Human+Machine Learning
In this paper we describe a novel method to integrate interactive visual analysis and machine learning to support the insight generation of the user. The suggested approach combine...
Raphael Fuchs, Jürgen Waser, Meister Eduard Gr...
FLAIRS
2008
13 years 9 months ago
Learning a Probabilistic Model of Event Sequences from Internet Weblog Stories
One of the central problems in building broad-coverage story understanding systems is generating expectations about event sequences, i.e. predicting what happens next given some a...
Mehdi Manshadi, Reid Swanson, Andrew S. Gordon