Sciweavers

869 search results - page 7 / 174
» MicroARTMAP for pattern recognition problems
Sort
View
GBRPR
2007
Springer
14 years 1 months ago
A Quadratic Programming Approach to the Graph Edit Distance Problem
In this paper we propose a quadratic programming approach to computing the edit distance of graphs. Whereas the standard edit distance is defined with respect to a minimum-cost ed...
Michel Neuhaus, Horst Bunke
ICCV
2005
IEEE
14 years 1 months ago
Local Gabor Binary Pattern Histogram Sequence (LGBPHS): A Novel Non-Statistical Model for Face Representation and Recognition
For years, researchers in face recognition area have been representing and recognizing faces based on subspace discriminant analysis or statistical learning. Nevertheless, these a...
Wenchao Zhang, Shiguang Shan, Wen Gao, Xilin Chen,...
PROCEDIA
2011
12 years 10 months ago
Exact Closest String as a Constraint Satisfaction Problem
We report the first evaluation of Constraint Satisfaction as a computational framework for solving closest string problems. We show that careful consideration of symbol occurrenc...
Tom Kelsey, Lars Kotthoff
RECOMB
2005
Springer
14 years 8 months ago
Recognition of Binding Patterns Common to a Set of Protein Structures
We present a novel computational method, MultiBind, for recognition of binding patterns common to a set of protein structures. It is the first method which performs a multiple alig...
Maxim Shatsky, Alexandra Shulman-Peleg, Ruth Nussi...
ACIVS
2009
Springer
14 years 2 months ago
Attributed Graph Matching Using Local Descriptions
Abstract. In the pattern recognition context, objects can be represented as graphs with attributed nodes and edges involving their relations. Consequently, matching attributed grap...
Salim Jouili, Ines Mili, Salvatore Tabbone