Sciweavers

153 search results - page 16 / 31
» Efficient top-k processing over query-dependent functions
Sort
View
EMNLP
2009
13 years 6 months ago
Stream-based Randomised Language Models for SMT
Randomised techniques allow very big language models to be represented succinctly. However, being batch-based they are unsuitable for modelling an unbounded stream of language whi...
Abby Levenberg, Miles Osborne
ICML
2010
IEEE
13 years 9 months ago
Bayesian Multi-Task Reinforcement Learning
We consider the problem of multi-task reinforcement learning where the learner is provided with a set of tasks, for which only a small number of samples can be generated for any g...
Alessandro Lazaric, Mohammad Ghavamzadeh
WSCG
2004
212views more  WSCG 2004»
13 years 10 months ago
Face and Hands Segmentation in Color Images and Initial Matching with a Biomechanical Model
In this paper we describe a robust and efficient procedure to detect skin region with homogeneous color values in monocular indoor images. The mathematical background is a functio...
Jose Maria Buades Rubio, Manuel González Hi...
DEDS
2010
157views more  DEDS 2010»
13 years 6 months ago
On-line Optimal Control of a Class of Discrete Event Systems with Real-Time Constraints
We consider Discrete Event Systems (DES) involving tasks with real-time constraints and seek to control processing times so as to minimize a cost function subject to each task mee...
Jianfeng Mao, Christos G. Cassandras
RCIS
2010
13 years 7 months ago
A Tree-based Approach for Efficiently Mining Approximate Frequent Itemsets
—The strategies for mining frequent itemsets, which is the essential part of discovering association rules, have been widely studied over the last decade. In real-world datasets,...
Jia-Ling Koh, Yi-Lang Tu