Sciweavers

1566 search results - page 50 / 314
» Saving Space in a Time Efficient Simulation Algorithm
Sort
View
ICDM
2005
IEEE
271views Data Mining» more  ICDM 2005»
14 years 1 months ago
HOT SAX: Efficiently Finding the Most Unusual Time Series Subsequence
In this work, we introduce the new problem of finding time series discords. Time series discords are subsequences of a longer time series that are maximally different to all the r...
Eamonn J. Keogh, Jessica Lin, Ada Wai-Chee Fu
DOLAP
2004
ACM
14 years 1 months ago
PrefixCube: prefix-sharing condensed data cube
BST Condensed Cube is a fully computed cube that condenses those tuples, which are aggregated from the same single base relation tuple, into one physical tuple. Although it has be...
Jianlin Feng, Qiong Fang, Hulin Ding
RTSS
1996
IEEE
14 years 15 days ago
Reducing the number of clock variables of timed automata
We propose a method for reducing the number of clocks of a timed automaton by combining two algorithms. The first one consists in detecting active clocks, that is, those clocks wh...
Conrado Daws, Sergio Yovine
DASFAA
2008
IEEE
94views Database» more  DASFAA 2008»
13 years 10 months ago
Efficient Algorithms for Node Disjoint Subgraph Homeomorphism Determination
Recently, great efforts have been dedicated to researches on the management of large-scale graph-based data, where node disjoint subgraph homeomorphism relation between graphs has ...
Yanghua Xiao, Wentao Wu, Wei Wang 0009, Zhenying H...
SAC
2006
ACM
14 years 2 months ago
Adaptive page-level incremental checkpointing based on expected recovery time
Incremental checkpointing, which is intended to minimize checkpointing overhead, saves only the modified pages of a process. This means that in incremental checkpointing, the time...
Sangho Yi, Junyoung Heo, Yookun Cho, Jiman Hong