1523 search results - page 75 / 305 » The Computational Complexity of Linear Optics |
176
click to vote
VTC
2006
IEEE
16 years 5 days ago
2006
IEEE
Abstract— This paper proposes a maximum likelihood detection (MLD) method for the differential space-time block code (DSTBC) in cooperation with blind linear prediction (BLP) of ...
163
click to vote
ARITH
2005
IEEE
15 years 11 months ago
2005
IEEE
Abstract— Modular reduction is a fundamental operation in cryptographic systems. Most well known modular reduction methods including Barrett’s and Montgomery’s algorithms lev...
152
click to vote
CIARP
2006
Springer
15 years 10 months ago
2006
Springer
Linear dimensionality reduction (LDR) is quite important in pattern recognition due to its efficiency and low computational complexity. In this paper, we extend the two-class Chern...
139
click to vote
IMA
1995
Springer
15 years 9 months ago
1995
Springer
An algorithm for finding small-weight words in large linear codes is developed and a precise analysis of its complexity is given. It is in particular able to decode random [512,256...
155
click to vote
JMLR
2008
15 years 6 months ago
2008
Classifiers favoring sparse solutions, such as support vector machines, relevance vector machines, LASSO-regression based classifiers, etc., provide competitive methods for classi...