541 search results - page 36 / 109 » An Efficient Algorithm for the Longest Pattern Subsequence P... |
SODA
2000
ACM
13 years 10 months ago
2000
ACM
Real Scaled Matching is the problem of finding all locations in the text where the pattern, proportionally enlarged according to an arbitrary real-sized scale, appears. Real scale...
AAAI
2010
13 years 10 months ago
2010
Lifting can greatly reduce the cost of inference on firstorder probabilistic graphical models, but constructing the lifted network can itself be quite costly. In online applicatio...
KDD
2010
ACM
14 years 18 days ago
2010
ACM
The detection of repeated subsequences, time series motifs, is a problem which has been shown to have great utility for several higher-level data mining algorithms, including clas...
PODS
2006
ACM
14 years 9 months ago
2006
ACM
d Abstract] Guizhen Yang Artificial Intelligence Center SRI International Menlo Park, CA 94025, USA Michael Kifer Dept. of Computer Science Stony Brook University Stony Brook, NY 1...
DAWAK
2005
Springer
14 years 2 months ago
2005
Springer
Data mining and machine learning must confront the problem of pattern maintenance because data updating is a fundamental operation in data management. Most existing data-mining alg...