Online windowed subsequence matching over probabilistic sequences

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Zheng Li University of Massachusetts, Lowell, Lowell, MA, USA
Tingjian Ge University of Massachusetts, Lowell, Lowell, MA, USA
Published in:
Cover Image
 
· Proceeding
SIGMOD '12 Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data
Pages 277-288
ACM New York, NY, USA ©2012
table of contents ISBN: 978-1-4503-1247-9 doi>10.1145/2213836.2213868
Online windowed subsequence matching over probabilistic sequences Published by ACM 2012 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 32
· Downloads (12 Months): 286
· Downloads (cumulative): 286
· Citation Count: 0


Tools and Resources

Share:

|
feedback Feedback | Switch to single page view (no tabs)

Powered by The ACM Guide to Computing Literature


The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2013 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player
The ACM Guide to Computing Literature
All Tags
Export Formats
 
 
Save to Binder