Sciweavers

101 search results - page 15 / 21
» Efficient Reductions for Imitation Learning
Sort
View
KBSE
2009
IEEE
14 years 2 months ago
Code Completion from Abbreviated Input
—Abbreviation Completion is a novel technique to improve the efficiency of code-writing by supporting code completion of multiple keywords based on non-predefined abbreviated inp...
Sangmok Han, David R. Wallace, Robert C. Miller
ACL
1996
13 years 8 months ago
Minimizing Manual Annotation Cost in Supervised Training from Corpora
Corpus-based methods for natural language processing often use supervised training, requiring expensive manual annotation of training corpora. This paper investigates methods for ...
Sean P. Engelson, Ido Dagan
NIPS
2008
13 years 8 months ago
One sketch for all: Theory and Application of Conditional Random Sampling
Conditional Random Sampling (CRS) was originally proposed for efficiently computing pairwise (l2, l1) distances, in static, large-scale, and sparse data. This study modifies the o...
Ping Li, Kenneth Ward Church, Trevor Hastie
TCSV
2008
297views more  TCSV 2008»
13 years 7 months ago
Activity Analysis, Summarization, and Visualization for Indoor Human Activity Monitoring
Abstract--In this work, we study how continuous video monitoring and intelligent video processing can be used in eldercare to assist the independent living of elders and to improve...
Zhongna Zhou, Xi Chen, Yu-Chia Chung, Zhihai He, T...
ICML
2008
IEEE
14 years 8 months ago
Expectation-maximization for sparse and non-negative PCA
We study the problem of finding the dominant eigenvector of the sample covariance matrix, under additional constraints on the vector: a cardinality constraint limits the number of...
Christian D. Sigg, Joachim M. Buhmann