๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Efficient algorithm for BCNF-decomposition

โœ Scribed by W-Y Liu

Book ID
103969504
Publisher
Elsevier Science
Year
1992
Tongue
English
Weight
354 KB
Volume
34
Category
Article
ISSN
0950-5849

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Efficient and Practical Algorithms for S
Efficient and Practical Algorithms for Sequential Modular Decomposition
โœ Elias Dahlhaus; Jens Gustedt; Ross M McConnell ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 214 KB

A module of an undirected graph G = V E is a set X of vertices that have the same set of neighbors in V \X. The modular decomposition is a unique decomposition of the vertices into nested modules. We give a practical algorithm with an O n + mฮฑ m n time bound and a variant with a linear time bound.

An efficient algorithm for generalized d
An efficient algorithm for generalized discriminant analysis using incomplete Cholesky decomposition
โœ Haixian Wang; Zilan Hu; Yuโ€™e Zhao ๐Ÿ“‚ Article ๐Ÿ“… 2007 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 626 KB

Generalized discriminant analysis (GDA) has provided an extremely powerful approach to extracting nonlinear features via kernel trick. And it has been suggested for a number of applications, such as classification problem. Whereas the GDA could be solved by the utilization of Mercer kernels, a drawb