2168 search results - page 272 / 434 » Using Approximation Hardness to Achieve Dependable Computati... |
130
click to vote
ICASSP
2011
IEEE
14 years 8 months ago
2011
IEEE
It is well known that LDPC decoding is computationally demanding and one of the hardest signal operations to parallelize. Beyond data dependencies that restrict the decoding of a ...
162
click to vote
GECCO
2005
Springer
15 years 10 months ago
2005
Springer
Several ways of using singular value decomposition (SVD), a linear algebra technique typically used for information retrieval, to decompose problems into subproblems are investiga...
158
click to vote
WCNC
2010
IEEE
15 years 2 months ago
2010
IEEE
—In this paper, we present a novel multi-carrier spread spectrum (MCSS) system which uses Parallel Sequence Spread Spectrum (PSSS) as its spreading transform. This technique call...
159
click to vote
CVPR
2001
IEEE
16 years 6 months ago
2001
IEEE
This paper presents a novel processing scheme for the automatic computation of a medial shape model which is representative for an object population with shape variability. The se...
133
click to vote
CVPR
2003
IEEE
16 years 6 months ago
2003
IEEE
When performing subspace modelling of data using Principal Component Analysis (PCA) it may be desirable to constrain certain directions to be more meaningful in the context of the...