6568 search results - page 71 / 1314 » Reducing the Complexity of Reductions |
181
click to vote
PR
2008
15 years 6 months ago
2008
7 Linear discriminant analysis (LDA) is a dimension reduction method which finds an optimal linear transformation that maximizes the class separability. However, in undersampled p...
204
click to vote
IPCV
2008
15 years 7 months ago
2008
Linear Discriminant Analysis(LDA) is well-known scheme for feature extraction and dimension reduction. It has been used widely in many applications involving high-dimensional data,...
158
Voted
FOCS
2000
IEEE
15 years 10 months ago
2000
IEEE
We show that the graph isomorphism problem is hard under DLOGTIME uniform AC0 many-one reductions for the complexity classes NL, PL (probabilistic logarithmic space) for every loga...
124
click to vote
DATE
2010
IEEE
15 years 10 months ago
2010
IEEE
We have proposed (, )-based flow regulation to reduce delay and backlog bounds in SoC architectures, where bounds the traffic burstiness and the traffic rate. The regulation is co...
143
click to vote
ICCAD
1995
IEEE
15 years 9 months ago
1995
IEEE
This paper presents a linear time algorithm to reduce a large RC interconnect network into subnetworks which are approximated with lower order equivalent RC circuits. The number o...