4886 search results - page 759 / 978 » Approximate Data Exchange |
138
Voted
EDBT
2004
ACM
16 years 4 months ago
2004
ACM
We present a novel anytime version of partitional clustering algorithm, such as k-Means and EM, for time series. The algorithm works by leveraging off the multi-resolution property...
155
click to vote
SODA
2010
ACM
16 years 1 months ago
2010
ACM
We give an O(n lg n)-time algorithm for counting the number of inversions in a permutation on n elements. This improves a long-standing previous bound of O(n lg n/ lg lg n) that ...
111
click to vote
SDM
2009
SIAM
16 years 1 months ago
2009
SIAM
The discovery of events in time series can have important implications, such as identifying microlensing events in astronomical surveys, or changes in a patient’s electrocardiog...
113
click to vote
ICCD
2005
IEEE
16 years 1 months ago
2005
IEEE
Cache memories are commonly implemented through multiple memory banks to improve bandwidth and latency. The early knowledge of the data cache bank that an instruction will access ...
122
click to vote
Publication
Detection of motion patterns in video data can be significantly simplified by abstracting away from pixel
intensity values towards representations that explicitly and compactly ca...