903 search results - page 92 / 181 » On the reduction of a random basis |
188
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
In this paper, we consider the problem of planning and learning in the infinite-horizon discounted-reward Markov decision problems. We propose a novel iterative direct policysearc...
131
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
We consider the ‘one-shot frame synchronization problem’ where a decoder wants to locate a sync pattern at the output of a channel on the basis of sequential observations. We ...
159
click to vote
INFOCOM
2009
IEEE
16 years 28 days ago
2009
IEEE
—A novel counter architecture, called Counter Braids, has recently been proposed for accurate per-flow measurement on high-speed links. Inspired by sparse random graph codes, Co...
176
click to vote
EUROCRYPT
2007
Springer
15 years 10 months ago
2007
Springer
We show an efficient secure two-party protocol, based on Yao's construction, which provides security against malicious adversaries. Yao's original protocol is only secur...
172
click to vote
ACL
2006
15 years 7 months ago
2006
This paper shows that a simple two-stage approach to handle non-local dependencies in Named Entity Recognition (NER) can outperform existing approaches that handle non-local depen...