13603 search results - page 284 / 2721 » On the Complexity of Computing Treelength |
171
click to vote
ICASSP
2009
IEEE
16 years 24 days ago
2009
IEEE
We propose a variant of Orthogonal Matching Pursuit (OMP), called LoCOMP, for scalable sparse signal approximation. The algorithm is designed for shift-invariant signal dictionari...
149
click to vote
ICC
2007
IEEE
16 years 12 days ago
2007
IEEE
— Traditional multiple-antenna detectors – which search a tree or a lattice structure – typically apply a metric that requires a preprocessing. Contrary to that, we present a...
194
Voted
TAMC
2007
Springer
16 years 5 days ago
2007
Springer
Abstract. We develop a refinement of a forbidden submatrix characterization of 0/1-matrices fulfilling the Consecutive Ones Property (C1P). This novel characterization finds app...
127
click to vote
ISMVL
2005
IEEE
15 years 11 months ago
2005
IEEE
In digital signal processing, we often use higher radix system to achieve high-speed computation. In such cases, we require radix converters. This paper considers the design of LU...
126
click to vote
DSD
2002
IEEE
15 years 11 months ago
2002
IEEE
We use a formal tool to extract Finite State Machines (FSM) based representations (lists of states and transitions) of sequential circuits described by flip-flops and gates. The...