430 search results - page 9 / 86 » A New Linearizing Restriction in the Pattern Matching Proble... |
SODA
2010
ACM
14 years 5 months ago
2010
ACM
The hypergraph matching problem is to find a largest collection of disjoint hyperedges in a hypergraph. This is a well-studied problem in combinatorial optimization and graph theo...
LATA
2009
Springer
14 years 2 months ago
2009
Springer
The parameterized pattern matching problem is a kind of pattern matching problem, where a pattern is considered to occur in a text when there exists a renaming bijection on the alp...
BMCBI
2007
13 years 8 months ago
2007
Background: Computational methods to predict transcription factor binding sites (TFBS) based on exhaustive algorithms are guaranteed to find the best patterns but are often limite...
PSIVT
2009
Springer
14 years 17 days ago
2009
Springer
Abstract. Robust object tracking is required by many vision applications, and it will be useful for the motion analysis of moving object if we can not only track the object, but al...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
Classic algorithms for sequential pattern discovery, return all frequent sequences present in a database. Since, in general, only a few ones are interesting from a user's poin...