Sciweavers

2374 search results - page 336 / 475
» The language of machines
Sort
View
ML
2007
ACM
101views Machine Learning» more  ML 2007»
13 years 10 months ago
A persistent union-find data structure
The problem of disjoint sets, also known as union-find, consists in maintaining a partition of a finite set within a data structure. This structure provides two operations: a fu...
Sylvain Conchon, Jean-Christophe Filliâtre
ML
2010
ACM
124views Machine Learning» more  ML 2010»
13 years 9 months ago
Large scale image annotation: learning to rank with joint word-image embeddings
Image annotation datasets are becoming larger and larger, with tens of millions of images and tens of thousands of possible annotations. We propose a strongly performing method tha...
Jason Weston, Samy Bengio, Nicolas Usunier
COLT
2010
Springer
13 years 8 months ago
Strongly Non-U-Shaped Learning Results by General Techniques
In learning, a semantic or behavioral U-shape occurs when a learner rst learns, then unlearns, and, nally, relearns, some target concept (on the way to success). Within the framew...
John Case, Timo Kötzing
ICMLA
2010
13 years 8 months ago
Robust Learning for Adaptive Programs by Leveraging Program Structure
Abstract--We study how to effectively integrate reinforcement learning (RL) and programming languages via adaptation-based programming, where programs can include non-deterministic...
Jervis Pinto, Alan Fern, Tim Bauer, Martin Erwig
IEAAIE
2009
Springer
13 years 8 months ago
Two Applications of Lexical Information to Computer-Assisted Item Authoring for Elementary Chinese
1 Testing is a popular way to assess one's competence in a language. The assessment can be conducted by the students for self evaluation or by the teachers in achievement test...
Chao-Lin Liu, Kan-Wen Tien, Yi-Hsuan Chuang, Chih-...