Results 131 to 140 of about 2,954,755 (181)

Sequence Classification via LCS

2022
Computing a longest common subsequence of two given sequences is a fundamental problem in several fields of computer science. While there exist dynamic programming algorithms that can solve the problem in polynomial-time, their running time is considered too high for some practical applications.
openaire   +2 more sources

Face classification via sparse approximations

2011 IEEE 19th Signal Processing and Communications Applications Conference (SIU), 2011
2D face classification problem is very difficult because of the illumination, pose, expression and occlusion factor. The sparse Representation based classification (SRC) provides a significant amount of robustness against to illumination changes and noise.
Elena Battini Sőnmez   +2 more
openaire   +1 more source

Home - About - Disclaimer - Privacy