2498 search results - page 85 / 500 » Data Structures with Unpredictable Timing |
KDD
1998
ACM
15 years 2 months ago
1998
ACM
Many data mining tasks (e.g., Association Rules, Sequential Patterns) use complex pointer-based data structures (e.g., hash trees) that typically suffer from sub-optimal data loca...
ESA
2006
Springer
14 years 11 months ago
2006
Springer
We present a purely functional implementation of search trees that requires O(log n) time for search and update operations and supports the join of two trees in worst case constant...
CVPR
1999
IEEE
15 years 12 months ago
1999
IEEE
We present a novel mixed-state dynamic Bayesian network (DBN) framework for modeling and classifying timeseries data such as object trajectories. A hidden Markov model (HMM) of di...
ICEBE
2009
IEEE
15 years 4 months ago
2009
IEEE
—Service-oriented architecture (SOA) provides the flexibility of dynamically composing business processes in enterprise computing. However, they must be enhanced to support real...
PAKDD
2010
ACM
15 years 2 months ago
2010
ACM
In this paper, we propose a method for online subsequence matching between histogram-based stream synopsis structures under the dynamic warping distance. Given a query synopsis pat...