Sciweavers

4114 search results - page 204 / 823
» Efficient Algorithms for the 2-Center Problems
Sort
View
ADMA
2009
Springer
186views Data Mining» more  ADMA 2009»
16 years 1 months ago
Mining Compressed Repetitive Gapped Sequential Patterns Efficiently
Mining frequent sequential patterns from sequence databases has been a central research topic in data mining and various efficient mining sequential patterns algorithms have been p...
Yongxin Tong, Zhao Li, Dan Yu, Shilong Ma, Zhiyuan...
ICDE
2006
IEEE
188views Database» more  ICDE 2006»
16 years 7 months ago
Efficiently Evaluating Order Preserving Similarity Queries over Historical Market-Basket Data
We introduce a new domain-independent framework for formulating and efficiently evaluating similarity queries over historical data, where given a history as a sequence of timestam...
Reza Sherkat, Davood Rafiei
ICDE
2009
IEEE
173views Database» more  ICDE 2009»
16 years 8 months ago
Efficient Processing of Warping Time Series Join of Motion Capture Data
Discovering non-trivial matching subsequences from two time series is very useful in synthesizing novel time series. This can be applied to applications such as motion synthesis wh...
Yueguo Chen, Gang Chen, Ke Chen, Beng Chin Ooi
DMDW
2000
93views Management» more  DMDW 2000»
15 years 7 months ago
Storing auxiliary data for efficient maintenance and lineage tracing of complex views
As views in a data warehouse become more complex, the view maintenance process can become very complicated and potentially very inefficient. Storing auxiliary views in the warehou...
Yingwei Cui, Jennifer Widom
ICDE
2008
IEEE
336views Database» more  ICDE 2008»
16 years 7 months ago
Dominant Graph: An Efficient Indexing Structure to Answer Top-K Queries
Given a record set D and a query score function F, a top-k query returns k records from D, whose values of function F on their attributes are the highest. In this paper, we investi...
Lei Zou, Lei Chen 0002