2498 search results - page 133 / 500 » Data Structures with Unpredictable Timing |
SDM
2009
SIAM
15 years 7 months ago
2009
SIAM
Time series motifs are pairs of individual time series, or subsequences of a longer time series, which are very similar to each other. As with their discrete analogues in computat...
SWAT
2004
Springer
15 years 3 months ago
2004
Springer
We show that any priority queue data structure that supports insert, delete, and find-min operations in pq(n) time, when n is an upper bound on the number of elements in the prio...
MOBISYS
2009
ACM
15 years 10 months ago
2009
ACM
The extraction of temporal characteristics from sensor data streams can reveal important properties about the sensed events. Knowledge of temporal characteristics in applications ...
120
click to vote
CORR
2010
Springer
14 years 5 months ago
2010
Springer
In this paper we describe a new efficient (in fact optimal) data structure for the top-K color problem. Each element of an array A is assigned a color c with priority p(c). For a ...
102
click to vote
KDD
2004
ACM
15 years 10 months ago
2004
ACM
Many automated learning procedures lack interpretability, operating effectively as a black box: providing a prediction tool but no explanation of the underlying dynamics that driv...