2463 search results - page 250 / 493 » Compressing Pattern Databases |
95
Voted
CIKM
1998
Springer
15 years 3 months ago
1998
Springer
In this paper we present SPADE, a new algorithm for fast discovery of Sequential Patterns. The existing solutions to this problem make repeated database scans, and use complex has...
102
Voted
BTW
2009
Springer
15 years 1 days ago
2009
Springer
: Similarity search and data mining on time series databases has recently attracted much attention. In this paper, we represent a data object by several time series-valued attribut...
FOCM
2010
14 years 8 months ago
2010
This paper presents a numerical compression strategy for the boundary integral equation of acoustic scattering in two dimensions. These equations have oscillatory kernels that we ...
106
click to vote
SIGIR
2011
ACM
14 years 1 months ago
2011
ACM
Inverted indexes are the most fundamental and widely used data structures in information retrieval. For each unique word occurring in a document collection, the inverted index sto...
187
Voted
ICDE
2004
IEEE
16 years 8 days ago
2004
IEEE
Frequent structure mining (FSM) aims to discover and extract patterns frequently occurring in structural data, such as trees and graphs. FSM finds many applications in bioinformat...