Detection of focal epilepsy in brain maps through a novel pattern recognition technique

2019 ◽  
Vol 32 (14) ◽  
pp. 10143-10157 ◽  
Author(s):  
Eric Ceballos Dominguez ◽  
M. S. P. Subathra ◽  
N. J. Sairamya ◽  
S. Thomas George
Keyword(s):  
Pattern Recognition ◽  
Focal Epilepsy ◽  
Pattern Recognition Technique ◽  
Brain Maps ◽  
Recognition Technique

A Variant Group Assignment Three Dimensional Model Using Pattern Recognition Technique

2019 ◽  
Vol 10 (6) ◽  
pp. 1382-1394
Author(s):  
R. Vijayalakshmi ◽  
V. K. Soma Sekhar Srinivas ◽  
E. Manjoolatha ◽  
G. Rajeswari ◽  
M. Sundaramurthy
Keyword(s):  
Pattern Recognition ◽  
Three Dimensional ◽  
Dimensional Model ◽  
Three Dimensional Model ◽  
Pattern Recognition Technique ◽  
Group Assignment ◽  
Recognition Technique

False color data imaging: A new pattern recognition technique for analyzing chromatographic profile data

1990 ◽  
Vol 41 (3) ◽  
pp. 288-295 ◽  
Author(s):  
Barry K. Lavine ◽  
Robert K. Vander Meer ◽  
Laurence Morel ◽  
Robert W. Gunderson ◽  
Jian Hwa Han ◽  
...  
Keyword(s):  
Pattern Recognition ◽  
Profile Data ◽  
Pattern Recognition Technique ◽  
False Color ◽  
Chromatographic Profile ◽  
Color Data ◽  
Recognition Technique

scholarly journals P-Path Minimum Distance Connectivity from Head Quarter to the Cities

2013 ◽  
Vol 4 (2) ◽  
pp. 280-294
Author(s):  
Revathi P ◽  
Suresh Babu C ◽  
Purusotham S ◽  
Sundara Murthy M
Keyword(s):  
Pattern Recognition ◽  
Minimum Distance ◽  
Search Algorithm ◽  
Distance Matrix ◽  
Pattern Recognition Technique ◽  
Individual Factor ◽  
Linear Polynomial ◽  
Higher Dimensional ◽  
Combinatorial Programming ◽  
Recognition Technique

Many Combinatorial programming problems are NP-hard (Non Linear Polynomial), and we consider one of them called P path minimum distance connectivity from head quarter to the cities. Let there be n cities and the distance matrix D(i, j, k) is given from ithcity to jthcity using kthfacility. There can be an individual factor which influences the distances/cost and that factor is represented as a facility k. We consider m<n cities are in cluster and to connect all the cities in subgroup (cluster) from others by using same facility k. The problem is to find minimum distance to connect all the cities from head quarter (say 1) threw p-paths subject to the above considerations. For this problem we developed a Pattern Recognition Technique based Lexi Search Algorithm, we programmed the proposed algorithm using C. we compared with the existed models and conclude that it suggested for solving the higher dimensional problems.

Assessment of weather-based influent scenarios for a WWTP: Application of a pattern recognition technique

2019 ◽  
Vol 242 ◽  
pp. 450-456 ◽  
Author(s):  
Sina Borzooei ◽  
Gisele H.B. Miranda ◽  
Ramesh Teegavarapu ◽  
Gerardo Scibilia ◽  
Lorenza Meucci ◽  
...  
Keyword(s):  
Pattern Recognition ◽  
Pattern Recognition Technique ◽  
Recognition Technique
Sign in / Sign up

Export Citation Format

Share Document