Sciweavers

1380 search results - page 219 / 276
» On Universal Transfer Learning
Sort
View
ICML
2003
IEEE
16 years 20 days ago
Online Convex Programming and Generalized Infinitesimal Gradient Ascent
Convex programming involves a convex set F Rn and a convex cost function c : F R. The goal of convex programming is to find a point in F which minimizes c. In online convex prog...
Martin Zinkevich
ICML
1999
IEEE
16 years 20 days ago
Abstracting from Robot Sensor Data using Hidden Markov Models
ing from Robot Sensor Data using Hidden Markov Models Laura Firoiu, Paul Cohen Computer Science Department, LGRC University of Massachusetts at Amherst, Box 34610 Amherst, MA 01003...
Laura Firoiu, Paul R. Cohen
ICSE
2008
IEEE-ACM
16 years 20 days ago
Best practices in extreme programming course design
Teaching (and therefore learning) eXtreme Programming (XP) in a university setting is difficult because of course time limitations and the soft nature of XP that requires first-ha...
Kai Stapel, Daniel Lübke, Eric Knauss
CHI
2001
ACM
16 years 6 days ago
Beyond command knowledge: identifying and teaching strategic knowledge for using complex computer applications
Despite experience, many users do not make efficient use of complex computer applications. We argue that this is caused by a lack of strategic knowledge that is difficult to acqui...
Suresh K. Bhavnani, Frederick Reif, Bonnie E. John
ALT
2002
Springer
15 years 8 months ago
How to Achieve Minimax Expected Kullback-Leibler Distance from an Unknown Finite Distribution
Abstract. We consider a problem that is related to the “Universal Encoding Problem” from information theory. The basic goal is to find rules that map “partial information”...
Dietrich Braess, Jürgen Forster, Tomas Sauer,...