Sciweavers

3641 search results - page 81 / 729
» On Computability of Pattern Recognition Problems
Sort
View
IPPS
2005
IEEE
15 years 6 months ago
A Case Study on Pattern-Based Systems for High Performance Computational Biology
Computational biology research is now faced with the burgeoning number of genome data. The rigorous postprocessing of this data requires an increased role for high performance com...
Weiguo Liu, Bertil Schmidt
ALMOB
2006
80views more  ALMOB 2006»
15 years 20 days ago
Effective p-value computations using Finite Markov Chain Imbedding (FMCI): application to local score and to pattern statistics
The technique of Finite Markov Chain Imbedding (FMCI) is a classical approach to complex combinatorial problems related to sequences. In order to get efficient algorithms, it is k...
Grégory Nuel
96
Voted
CSR
2006
Springer
15 years 4 months ago
Window Subsequence Problems for Compressed Texts
Given two strings (a text t of length n and a pattern p) and a natural number w, window subsequence problems consist in deciding whether p occurs as a subsequence of t and/or findi...
Patrick Cégielski, Irène Guessarian,...
102
Voted
OOPSLA
2005
Springer
15 years 6 months ago
Inferring context-free grammars for domain-specific languages
Grammatical inference (or grammar inference) has been applied to various problems in areas such as computational biology, and speech and pattern recognition but its application to...
Faizan Javed
PRL
2000
115views more  PRL 2000»
15 years 11 days ago
A new face detection method based on shape information
Automatic detection of human faces is one of the most dicult problems in pattern recognition. In many practical applications (e.g. personal identi
Jianguo Wang, Tieniu Tan