3913 search results - page 286 / 783 » complexity 2006 |
140
Voted
CORR
2006
Springer
15 years 6 months ago
2006
Springer
A linear time approximate maximum likelihood decoding algorithm on tail-biting trellises is presented, that requires exactly two rounds on the trellis. This is an adaptation of an ...
164
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
We propose a new algorithm to solve sparse linear systems of equations over the integers. This algorithm is based on a p-adic lifting technique combined with the use of block matr...
161
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
In this paper, we propose a method to adapt a general parser (Link Parser) to sublanguages, focusing on the parsing of texts in biology. Our main proposal is the use of terminolog...
157
Voted
CORR
2006
Springer
15 years 6 months ago
2006
Springer
In this paper we present a deeper analysis than has previously been carried out of a selective attention problem, and the evolution of continuous-time recurrent neural networks to...
117
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
The aim of this paper is to propose a method for tagging named entities (NE), using natural language processing techniques. Beyond their literal meaning, named entities are freque...