1732 search results - page 38 / 347 » Sequences of Level 1, 2, 3, ..., k , .. |
180
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
Compressed sensing is a novel technique where one can recover sparse signals from the undersampled measurements. In this paper, a K × N measurement matrix for compressed sensing ...
159
click to vote
CORR
2010
Springer
15 years 2 months ago
2010
Springer
One of the main problems in all-optical packet-switched networks is the lack of optical buffers, and one feasible technology for the constructions of optical buffers is to use opt...
192
click to vote
DAM
2011
15 years 1 months ago
2011
Partial words, which are sequences that may have some undefined positions called holes, can be viewed as sequences over an extended alphabet A = A ∪ { }, where stands for a hol...
151
click to vote
ACL
2010
15 years 4 months ago
2010
In this paper, we address the task of mapping high-level instructions to sequences of commands in an external environment. Processing these instructions is challenging--they posit...
137
click to vote
DM
2008
15 years 6 months ago
2008
Let G be a minimally k-connected graph with n nodes and m edges. Mader proved that if n 3k - 2 then m k(n - k), and for n 3k - 1 an equality is possible if, and only if, G is t...