590 search results - page 16 / 118 » Can We Learn to Beat the Best Stock |
TIT
2008
14 years 8 months ago
2008
We introduce a new state discrimination problem in which we are given additional information about the state after the measurement, or more generally, after a quantum memory bound ...
ICDM
2005
IEEE
15 years 3 months ago
2005
IEEE
In this paper, we propose a semi-supervised framework for learning a weighted Euclidean subspace, where the best clustering can be achieved. Our approach capitalizes on user-const...
111
click to vote
TAL
2010
Springer
14 years 7 months ago
2010
Springer
This paper shows how the best data-driven dependency parsers available today [1] can be improved by learning from unlabeled data. We focus on German and Swedish and show that label...
AAAI
2007
14 years 12 months ago
2007
Treebank parsing can be seen as the search for an optimally refined grammar consistent with a coarse training treebank. We describe a method in which a minimal grammar is hierarc...
109
click to vote
MST
2002
14 years 9 months ago
2002
Abstract. In this paper we consider communication issues arising in cellular (mobile) networks that utilize frequency division multiplexing (FDM) technology. In such networks, many...