Sciweavers

541 search results - page 12 / 109
» An Efficient Algorithm for the Longest Pattern Subsequence P...
Sort
View
ICDE
2007
IEEE
183views Database» more  ICDE 2007»
14 years 10 months ago
SpADe: On Shape-based Pattern Detection in Streaming Time Series
Monitoring predefined patterns in streaming time series is useful to applications such as trend-related analysis, sensor networks and video surveillance. Most current studies on s...
Yueguo Chen, Mario A. Nascimento, Beng Chin Ooi, A...
HICSS
2005
IEEE
164views Biometrics» more  HICSS 2005»
14 years 2 months ago
An Efficient Technique for Frequent Pattern Mining in Real-Time Business Applications
Association rule mining in real-time is of increasing thrust in many business applications. Applications such as e-commerce, recommender systems, supply-chain management and group...
Rajanish Dass, Ambuj Mahanti
WOB
2004
120views Bioinformatics» more  WOB 2004»
13 years 10 months ago
Reconfigurable Systems for Sequence Alignment and for General Dynamic Programming
ABSTRACT. Reconfigurable systolic arrays can be adapted to efficiently resolve a wide spectrum of computational problems; parallelism is naturally explored in systolic arrays and r...
Ricardo P. Jacobi, Mauricio Ayala-Rincón, L...
ALGORITHMICA
2006
94views more  ALGORITHMICA 2006»
13 years 9 months ago
Efficient Algorithms for k Maximum Sums
We study the problem of computing the k maximum sum subsequences. Given a sequence of real numbers x1, x2, . . . , xn and an integer parameter k, 1 k 1 2 n(n - 1), the problem in...
Fredrik Bengtsson, Jingsen Chen
JCSS
2002
95views more  JCSS 2002»
13 years 8 months ago
Efficient algorithms for locating the length-constrained heaviest segments with applications to biomolecular sequence analysis
We study two fundamental problems concerning the search for interesting regions in sequences: (i) given a sequence of real numbers of length n and an upper bound U; find a consecu...
Yaw-Ling Lin, Tao Jiang, Kun-Mao Chao