Sciweavers

151 search results - page 3 / 31
» Longest Common Pattern between two Permutations
Sort
View
ENGL
2007
94views more  ENGL 2007»
13 years 7 months ago
Common subproofs in proof pairs
Abstract—In any formal theory, a proof is a sequence of well formed formulas (wff). Here, we consider the digraph whose nodes are proofs and the edges are pairs of proofs such t...
Guillermo Morales-Luna
SIAMDM
1998
89views more  SIAMDM 1998»
13 years 7 months ago
String Noninclusion Optimization Problems
For every string inclusion relation there are two optimization problems: find a longest string included in every string of a given finite language, and find a shortest string in...
Anatoly R. Rubinov, Vadim G. Timkovsky
KDD
2000
ACM
115views Data Mining» more  KDD 2000»
13 years 11 months ago
Mining asynchronous periodic patterns in time series data
Periodicy detection in time series data is a challenging problem of great importance in many applications. Most previous work focused on mining synchronous periodic patterns and d...
Jiong Yang, Wei Wang 0010, Philip S. Yu
IPL
2008
95views more  IPL 2008»
13 years 7 months ago
Efficient algorithms for finding interleaving relationship between sequences
The longest common subsequence and sequence alignment problems have been studied extensively and they can be regarded as the relationship measurement between sequences. However, m...
Kuo-Si Huang, Chang-Biau Yang, Kuo-Tsung Tseng, Hs...
COMBINATORICS
2004
86views more  COMBINATORICS 2004»
13 years 7 months ago
Multiple Pattern Avoidance with respect to Fixed Points and Excedances
We study the distribution of the statistics `number of fixed points' and `number of excedances' in permutations avoiding subsets of patterns of length 3. We solve all th...
Sergi Elizalde