𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An efficient method for computing orthogonal discriminant vectors

✍ Scribed by Jinghua Wang; Yong Xu; David Zhang; Jane You

Book ID
113816511
Publisher
Elsevier Science
Year
2010
Tongue
English
Weight
653 KB
Volume
73
Category
Article
ISSN
0925-2312

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

An efficient kernel discriminant analysi
An efficient kernel discriminant analysis method
✍ Juwei Lu; K.N. Plataniotis; A.N. Venetsanopoulos; Jie Wang πŸ“‚ Article πŸ“… 2005 πŸ› Elsevier Science 🌐 English βš– 167 KB

Small sample size and high computational complexity are two major problems encountered when traditional kernel discriminant analysis methods are applied to high-dimensional pattern classification tasks such as face recognition. In this paper, we introduce a new kernel discriminant learning method, w

An efficient method for computing dynami
An efficient method for computing dynamic program slices
✍ D. Goswami; R. Mall πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 115 KB

We propose an efficient method for computing dynamic slices of programs. Our method is based on construction of data dependence edges of program dependence graph at run-time. We introduce the concept of compact dynamic dependence graphs (CDDGs) of programs. We show computation of dynamic slices usin