Sciweavers

1244 search results - page 233 / 249
» Searching in Higher Dimension
Sort
View
ISNN
2011
Springer
12 years 11 months ago
Orthogonal Feature Learning for Time Series Clustering
This paper presents a new method that uses orthogonalized features for time series clustering and classification. To cluster or classify time series data, either original data or...
Xiaozhe Wang, Leo Lopes
ICIP
2000
IEEE
14 years 10 months ago
Look up Table (LUT) Method for Image Halftoning
Recently we have applied Look Up Table (LUT) Method for inverse halftoning. We also proposed tree-structure LUT inverse halftoning in order to reduce memory requirements of the LU...
Murat Mese, Palghat P. Vaidyanathan
SIGMOD
2008
ACM
206views Database» more  SIGMOD 2008»
14 years 8 months ago
Ad-hoc aggregations of ranked lists in the presence of hierarchies
A variety of web sites and web based services produce textual lists at varying time granularities ranked according to several criteria. For example, Google Trends produces lists o...
Nilesh Bansal, Sudipto Guha, Nick Koudas
SDM
2009
SIAM
164views Data Mining» more  SDM 2009»
14 years 5 months ago
Exact Discovery of Time Series Motifs.
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...
Abdullah Mueen, Eamonn J. Keogh, M. Brandon Westov...
EUROSYS
2007
ACM
14 years 5 months ago
Competitive prefetching for concurrent sequential I/O
During concurrent I/O workloads, sequential access to one I/O stream can be interrupted by accesses to other streams in the system. Frequent switching between multiple sequential ...
Chuanpeng Li, Kai Shen, Athanasios E. Papathanasio...