Sciweavers

530 search results - page 84 / 106
» Learning Bounds for Domain Adaptation
Sort
View
ITS
2010
Springer
163views Multimedia» more  ITS 2010»
14 years 2 months ago
Using Problem-Solving Context to Assess Help Quality in Computer-Mediated Peer Tutoring
Collaborative activities, like peer tutoring, can be beneficial for student learning, but only when students are supported in interacting effectively. Constructing intelligent tuto...
Erin Walker, Sean Walker, Nikol Rummel, Kenneth R....
AAAI
2007
14 years 11 days ago
Restart Schedules for Ensembles of Problem Instances
The mean running time of a Las Vegas algorithm can often be dramatically reduced by periodically restarting it with a fresh random seed. The optimal restart schedule depends on th...
Matthew J. Streeter, Daniel Golovin, Stephen F. Sm...
MODELS
2010
Springer
13 years 8 months ago
Extending Variability for OCL Interpretation
Abstract. In recent years, OCL advanced from a language used to constrain UML models to a constraint language that is applied to various modelling languages. This includes Domain S...
Claas Wilke, Michael Thiele, Christian Wende
IROS
2007
IEEE
144views Robotics» more  IROS 2007»
14 years 4 months ago
Bipedal walking on rough terrain using manifold control
— This paper presents an algorithm for adapting periodic behavior to gradual shifts in task parameters. Since learning optimal control in high dimensional domains is subject to t...
Tom Erez, William D. Smart
CRYPTO
2001
Springer
111views Cryptology» more  CRYPTO 2001»
14 years 2 months ago
On the Cost of Reconstructing a Secret, or VSS with Optimal Reconstruction Phase
Consider a scenario where an l-bit secret has been distributed among n players by an honest dealer using some secret sharing scheme. Then, if all players behave honestly, the secre...
Ronald Cramer, Ivan Damgård, Serge Fehr