334 search results - page 36 / 67 » Scalable complex pattern search in sequential data |
142
click to vote
KDD
2004
ACM
16 years 5 months ago
2004
ACM
To enable information integration, schema matching is a critical step for discovering semantic correspondences of attributes across heterogeneous sources. While complex matchings ...
166
click to vote
DMKD
2004
ACM
15 years 10 months ago
2004
ACM
To enable information integration, schema matching is a critical step for discovering semantic correspondences of attributes across heterogeneous sources. As a new attempt, this p...
143
click to vote
DOLAP
2004
ACM
15 years 10 months ago
2004
ACM
Parallelism can be used for major performance improvement in large Data warehouses (DW) with performance and scalability challenges. A simple low-cost shared-nothing architecture ...
144
Voted
SDM
2009
SIAM
16 years 1 months ago
2009
SIAM
Subspace clustering and frequent itemset mining via “stepby-step” algorithms that search the subspace/pattern lattice in a top-down or bottom-up fashion do not scale to large ...
255
click to vote
ICDE
2002
IEEE
16 years 5 months ago
2002
IEEE
Nearest Neighbor search is an important and widely used problem in a number of important application domains. In many of these domains, the dimensionality of the data representati...