Sciweavers

1700 search results - page 69 / 340
» Combinatorial Pattern Matching
Sort
View
DCG
2007
58views more  DCG 2007»
13 years 7 months ago
Harmonic Algebraic Curves and Noncrossing Partitions
Motivated by Gauss’s first proof of the Fundamental Theorem of Algebra, we study the topology of harmonic algebraic curves. By the maximum principle, a harmonic curve has no bou...
Jeremy L. Martin, David Savitt, Ted Singer
SODA
1998
ACM
157views Algorithms» more  SODA 1998»
13 years 9 months ago
Approximate String Matching: A Simpler Faster Algorithm
We give two algorithms for finding all approximate matches of a pattern in a text, where the edit distance between the pattern and the matching text substring is at most k. The fir...
Richard Cole, Ramesh Hariharan
ICSM
2003
IEEE
14 years 1 months ago
On Modeling Software Architecture Recovery as Graph Matching
This paper presents a graph matching model for the software architecture recovery problem. Because of their expressiveness, the graphs have been widely used for representing both ...
Kamran Sartipi, Kostas Kontogiannis
SIGIR
2005
ACM
14 years 1 months ago
Generic soft pattern models for definitional question answering
This paper explores probabilistic lexico-syntactic pattern matching, also known as soft pattern matching. While previous methods in soft pattern matching are ad hoc in computing t...
Hang Cui, Min-Yen Kan, Tat-Seng Chua
FLAIRS
2003
13 years 9 months ago
Optimal Approach for Temporal Patterns Discovery
This paper presents new technique for discovering temporal patterns when considered primitives are intervals. Apriori technique is the most used one to deal with temporal patterns...
Khellaf Bouandas, Aomar Osmani