Sciweavers

1700 search results - page 18 / 340
» Combinatorial Pattern Matching
Sort
View
64
Voted
IWPEC
2009
Springer
15 years 4 months ago
Partitioning into Sets of Bounded Cardinality
Abstract. We show that the partitions of an n-element set into k members of a given set family can be counted in time O((2− )n ), where > 0 depends only on the maximum size am...
Mikko Koivisto
86
Voted
COMPSAC
2002
IEEE
15 years 2 months ago
A Dictionary-Based Compressed Pattern Matching Algorithm
Compressed pattern matching refers to the process of, given a text in a compressed form and a pattern, finding all the occurrences of the pattern in the text without decompressio...
Meng-Hang Ho, Hsu-Chun Yen
96
Voted
ACCV
2007
Springer
15 years 3 months ago
Accelerating Pattern Matching or How Much Can You Slide?
This paper describes a method that accelerates pattern matching. The distance between a pattern and a window is usually close to the distance of the pattern to the adjacement windo...
Ofir Pele, Michael Werman
IAAI
2003
14 years 11 months ago
LAW: A Workbench for Approximate Pattern Matching in Relational Data
Pattern matching for intelligence organizations is a challenging problem. The data sets are large and noisy, and there is a flexible and constantly changing notion of what consti...
Michael Wolverton, Pauline Berry, Ian W. Harrison,...
DCC
2004
IEEE
15 years 1 months ago
LZW Based Compressed Pattern Matching
Compressed pattern matching is an emerging research area that addresses the following problem: given a file in compressed format and a pattern, report the occurrence(s) of the pat...
Tao Tao, Amar Mukherjee