5154 search results - page 216 / 1031 » Modelling online education |
156
click to vote
WSOM
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. We show how the “Online Sparse Coding Neural Gas” algorithm can be applied to a more realistic model of the “Cocktail Party Problem”. We consider a setting where ...
121
click to vote
HICSS
2006
IEEE
15 years 10 months ago
2006
IEEE
This paper presents a novel online discussion environment that efficiently supports listening processes inspired by more collaborative management practices. This participative man...
149
click to vote
ICALP
2004
Springer
15 years 9 months ago
2004
Springer
We consider the following scheduling problem. The input is a set of jobs with equal processing times, where each job is specified by its release time and deadline. The goal is to ...
151
Voted
NIPS
2001
15 years 5 months ago
2001
In this paper, it is shown how to extract a hypothesis with small risk from the ensemble of hypotheses generated by an arbitrary on-line learning algorithm run on an independent an...
126
click to vote
SIGIR
2002
ACM
15 years 3 months ago
2002
ACM
We describe a new family of topic-ranking algorithms for multi-labeled documents. The motivation for the algorithms stems from recent advances in online learning algorithms. The a...