5100 search results - page 239 / 1020 » The Linear Complexity of a Graph |
117
click to vote
CIARP
2006
Springer
15 years 7 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...
113
Voted
IMA
1995
Springer
15 years 7 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...
130
click to vote
JMLR
2008
15 years 3 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...
137
click to vote
MP
2008
15 years 3 months ago
2008
Abstract. Two corrector-predictor interior point algorithms are proposed for solving monotone linear complementarity problems. The algorithms produce a sequence of iterates in the ...
TSP
2008
15 years 3 months ago
2008
Abstract--This paper tackles the theoretical performance analysis of widely-linear (WL) multiuser receivers for direct-sequence code-division multiple-access (DS-CDMA) systems, as ...