2887 search results - page 189 / 578 » Name Generation and Linearity |
163
click to vote
MST
2006
15 years 6 months ago
2006
The sequence selected from a sequence R(0)R(1) . . . by a language L is the subsequence of R that contains exactly the bits R(n + 1) such that the prefix R(0) . . . R(n) is in L. B...
134
click to vote
NA
2006
15 years 6 months ago
2006
Abstract. The present article summarizes the state of the art algorithms to compute the discrete Moreau envelope, and presents a new linear-time algorithm, named NEP for NonExpansi...
175
click to vote
TCOM
2008
15 years 6 months ago
2008
Abstract-- We address low-complexity, highly-accurate frequency offset estimation for MB-OFDM-based UWB systems. We discuss unique characteristics of the MB-OFDM systems, namely, d...
147
click to vote
ANOR
2002
15 years 6 months ago
2002
Classical approaches to location problems are based on the minimization of the average distance (the median concept) or the minimization of the maximum distance (the center concept...
157
click to vote
CORR
2004
Springer
15 years 6 months ago
2004
Springer
A (k, t)-track layout of a graph G consists of a (proper) vertex t-colouring of G, a total order of each vertex colour class, and a (non-proper) edge k-colouring such that between...