1129 search results - page 40 / 226 » Finding Similar Failures Using Callstack Similarity |
DCC
2005
IEEE
14 years 7 months ago
2005
IEEE
We describe a domain-independent, unsupervised algorithm for refined segmentation of time series data into meaningful episodes, focusing on the problem of text segmentation. The V...
ESA
2005
Springer
14 years 1 months ago
2005
Springer
We present an algorithm for finding shortest surface non-separating cycles in graphs embedded on surfaces in O(g3/2 V 3/2 log V + g5/2 V 1/2 ) time, where V is the number of vert...
INCDM
2010
Springer
13 years 10 months ago
2010
Springer
This paper describes an approach to temporal pattern mining
using the concept of user de ned temporal prototypes to de ne the
nature of the trends of interests. The temporal patt...
JCB
2007
13 years 7 months ago
2007
We developed a dynamic programming approach of computing common sequence structure patterns among two RNAs given their primary sequences and their secondary structures. Common pat...
SEMWEB
2007
Springer
14 years 2 months ago
2007
Springer
Ontology mapping is to find semantic correspondences between similar elements of different ontologies. It is critical to achieve semantic interoperability in the WWW. This paper su...