Sciweavers

1700 search results - page 90 / 340
» Combinatorial Pattern Matching
Sort
View
ECBS
2006
IEEE
115views Hardware» more  ECBS 2006»
14 years 4 months ago
Supporting Design Patterns with Annotations
Design patterns are an established means for building evolvable and maintainable object-oriented software. However, using them requires the developer’s extensive experience. A w...
Klaus Meffert
FUIN
2006
98views more  FUIN 2006»
13 years 10 months ago
On-line Approximate String Matching in Natural Language
We consider approximate pattern matching in natural language text. We use the words of the text as the alphabet, instead of the characters as in traditional string matching approac...
Kimmo Fredriksson
ACSC
2006
IEEE
14 years 4 months ago
Programming with heterogeneous structures: manipulating XML data using bondi
Manipulating semistructured data, such as XML, does not t well within conventional programming languages. A typical manipulation requires nding all occurrences of a structure matc...
F. Y. Huang, C. B. Jay, David B. Skillicorn
JIIS
2006
147views more  JIIS 2006»
13 years 10 months ago
Mining sequential patterns from data streams: a centroid approach
In recent years, emerging applications introduced new constraints for data mining methods. These constraints are typical of a new kind of data: the data streams. In data stream pro...
Alice Marascu, Florent Masseglia
JCT
2010
117views more  JCT 2010»
13 years 8 months ago
(2+2)-free posets, ascent sequences and pattern avoiding permutations
Abstract. We present bijections between four classes of combinatorial objects. Two of them, the class of unlabeled (2 + 2)-free posets and a certain class of involutions (or chord ...
Mireille Bousquet-Mélou, Anders Claesson, M...