Sciweavers

282 search results - page 53 / 57
» Online Learning of Approximate Dependency Parsing Algorithms
Sort
View
STOC
2007
ACM
100views Algorithms» more  STOC 2007»
14 years 8 months ago
Reordering buffers for general metric spaces
In the reordering buffer problem, we are given an input sequence of requests for service each of which corresponds to a point in a metric space. The cost of serving the requests h...
Matthias Englert, Harald Räcke, Matthias West...
SIGIR
2009
ACM
14 years 2 months ago
Fast nonparametric matrix factorization for large-scale collaborative filtering
With the sheer growth of online user data, it becomes challenging to develop preference learning algorithms that are sufficiently flexible in modeling but also affordable in com...
Kai Yu, Shenghuo Zhu, John D. Lafferty, Yihong Gon...
ACL
2012
11 years 10 months ago
Crosslingual Induction of Semantic Roles
We argue that multilingual parallel data provides a valuable source of indirect supervision for induction of shallow semantic representations. Specifically, we consider unsupervi...
Ivan Titov, Alexandre Klementiev
IPSN
2003
Springer
14 years 24 days ago
Hypothesis Testing over Factorizations for Data Association
Abstract. The issue of data association arises frequently in sensor networks; whenever multiple sensors and sources are present, it may be necessary to determine which observations...
Alexander T. Ihler, John W. Fisher III, Alan S. Wi...
DIS
2008
Springer
13 years 8 months ago
Empirical Asymmetric Selective Transfer in Multi-objective Decision Trees
We consider learning tasks where multiple target variables need to be predicted. Two approaches have been used in this setting: (a) build a separate single-target model for each ta...
Beau Piccart, Jan Struyf, Hendrik Blockeel