Sciweavers

74 search results - page 7 / 15
» Finding surprising patterns in a time series database in lin...
Sort
View
PETRA
2009
ACM
14 years 1 months ago
Towards faster activity search using embedding-based subsequence matching
Event search is the problem of identifying events or activity of interest in a large database storing long sequences of activity. In this paper, our topic is the problem of identi...
Panagiotis Papapetrou, Paul Doliotis, Vassilis Ath...
BMCBI
2008
115views more  BMCBI 2008»
13 years 6 months ago
PARPST: a PARallel algorithm to find peptide sequence tags
Background: Protein identification is one of the most challenging problems in proteomics. Tandem mass spectrometry provides an important tool to handle the protein identification ...
Sara Brunetti, Elena Lodi, Elisa Mori, Maria Stell...
ICDE
2007
IEEE
123views Database» more  ICDE 2007»
14 years 8 months ago
Stream Monitoring under the Time Warping Distance
The goal of this paper is to monitor numerical streams, and to find subsequences that are similar to a given query sequence, under the DTW (Dynamic Time Warping) distance. Applica...
Yasushi Sakurai, Christos Faloutsos, Masashi Yamam...
DBPL
2007
Springer
158views Database» more  DBPL 2007»
13 years 10 months ago
Efficient Algorithms for the Tree Homeomorphism Problem
Tree pattern matching is a fundamental problem that has a wide range of applications in Web data management, XML processing, and selective data dissemination. In this paper we deve...
Michaela Götz, Christoph Koch, Wim Martens
KDD
2009
ACM
203views Data Mining» more  KDD 2009»
14 years 7 months ago
Characterizing individual communication patterns
The increasing availability of electronic communication data, such as that arising from e-mail exchange, presents social and information scientists with new possibilities for char...
R. Dean Malmgren, Jake M. Hofman, Luis A. N. Amara...