Sciweavers

2363 search results - page 428 / 473
» Learning Algorithms for Domain Adaptation
Sort
View
STOC
2004
ACM
158views Algorithms» more  STOC 2004»
14 years 8 months ago
Collective asynchronous reading with polylogarithmic worst-case overhead
The Collect problem for an asynchronous shared-memory system has the objective for the processors to learn all values of a collection of shared registers, while minimizing the tot...
Bogdan S. Chlebus, Dariusz R. Kowalski, Alexander ...
KDD
2004
ACM
179views Data Mining» more  KDD 2004»
14 years 8 months ago
1-dimensional splines as building blocks for improving accuracy of risk outcomes models
Transformation of both the response variable and the predictors is commonly used in fitting regression models. However, these transformation methods do not always provide the maxi...
David S. Vogel, Morgan C. Wang
ICRA
2008
IEEE
190views Robotics» more  ICRA 2008»
14 years 2 months ago
Auditory mood detection for social and educational robots
— Social robots face the fundamental challenge of detecting and adapting their behavior to the current social mood. For example, robots that assist teachers in early education mu...
Paul Ruvolo, Ian R. Fasel, Javier R. Movellan
CORR
2004
Springer
103views Education» more  CORR 2004»
13 years 7 months ago
Online convex optimization in the bandit setting: gradient descent without a gradient
We study a general online convex optimization problem. We have a convex set S and an unknown sequence of cost functions c1, c2, . . . , and in each period, we choose a feasible po...
Abraham Flaxman, Adam Tauman Kalai, H. Brendan McM...
CEC
2005
IEEE
14 years 1 months ago
Multiobjective clustering around medoids
Abstract- The large majority of existing clustering algorithms are centered around the notion of a feature, that is, individual data items are represented by their intrinsic proper...
Julia Handl, Joshua D. Knowles