14704 search results - page 2354 / 2941 » computer 2007 |
171
click to vote
TAMC
2007
Springer
16 years 1 months ago
2007
Springer
For generalized Reed-Solomon codes, it has been proved [7] that the problem of determining if a received word is a deep hole is coNP-complete. The reduction relies on the fact that...
206
click to vote
TAMC
2007
Springer
16 years 1 months ago
2007
Springer
We consider the following problem in a stream model: Given a sequence a = a1, a2, . . . , am wich each ai ∈ [n] = {1, . . . , n} and m > n, find a duplicate in the sequence, ...
178
Voted
GECCO
2007
Springer
15 years 11 months ago
2007
Springer
EVITA, standing for Evolutionary Inventory and Transportation Algorithm, aims to be a commercial tool to address the problem of minimising both the transport and inventory costs o...
183
click to vote
CORR
2007
Springer
15 years 7 months ago
2007
Springer
— This paper introduces an expectation-maximization (EM) algorithm within a wavelet domain Bayesian framework for semi-blind channel estimation of multiband OFDM based UWB commun...
198
Voted
DAM
2007
15 years 7 months ago
2007
: Gavril [GA4] defined two new families of intersection graphs: the interval-filament graphs and the subtree-filament graphs. The complements of intervalfilament graphs are the coi...