Sciweavers

361 search results - page 64 / 73
» Finding Optimal Pairs of Patterns
Sort
View
ISCI
2008
116views more  ISCI 2008»
13 years 7 months ago
Discovery of maximum length frequent itemsets
The use of frequent itemsets has been limited by the high computational cost as well as the large number of resulting itemsets. In many real-world scenarios, however, it is often ...
Tianming Hu, Sam Yuan Sung, Hui Xiong, Qian Fu
PR
2008
129views more  PR 2008»
13 years 7 months ago
A comparison of generalized linear discriminant analysis algorithms
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...
Cheong Hee Park, Haesun Park
PR
2006
119views more  PR 2006»
13 years 7 months ago
Fingerprint matching by genetic algorithms
Fingerprint matching is still a challenging problem for reliable person authentication because of the complex distortions involved in two impressions of the same finger. In this p...
Xuejun Tan, Bir Bhanu
CCE
2005
13 years 7 months ago
New rigorous one-step MILP formulation for heat exchanger network synthesis
In this paper, a rigorous MILP formulation for grass-root design of heat exchanger networks is developed. The methodology does not rely on traditional supertargeting followed by n...
Andrés F. Barbaro, Miguel J. Bagajewicz
MOC
2000
83views more  MOC 2000»
13 years 7 months ago
Stability and B-convergence properties of multistep Runge-Kutta methods
This paper continues earlier work by the same author concerning the stability and B-convergence properties of multistep Runge-Kutta methods for the numerical solution of nonlinear ...
Shoufu Li