Sciweavers

4039 search results - page 233 / 808
» A Method for Dynamic Clustering of Data
Sort
View
ICDE
1999
IEEE
89views Database» more  ICDE 1999»
16 years 8 months ago
Relative Prefix Sums: An Efficient Approach for Querying Dynamic OLAP Data Cubes
Range sum queries on data cubes are a powerful tool for analysis. A range sum query applies an aggregation operation (e.g., SUM) over all selected cells in a data cube, where the ...
Steven Geffner, Divyakant Agrawal, Amr El Abbadi, ...
CVPR
2003
IEEE
16 years 8 months ago
Word Image Matching Using Dynamic Time Warping
Libraries and other institutions are interested in providing access to scanned versions of their large collections of handwritten historical manuscripts on electronic media. Conve...
Toni M. Rath, R. Manmatha
ICIP
2005
IEEE
16 years 8 months ago
Predictive compression of dynamic 3D meshes
An efficient algorithm for compression of dynamic time-consistent 3D meshes is presented. Such a sequence of meshes contains a large degree of temporal statistical dependencies tha...
Aljoscha Smolic, Karsten Müller, Matthias Kau...
AAAI
2008
15 years 9 months ago
Clustering via Random Walk Hitting Time on Directed Graphs
In this paper, we present a general data clustering algorithm which is based on the asymmetric pairwise measure of Markov random walk hitting time on directed graphs. Unlike tradi...
Mo Chen, Jianzhuang Liu, Xiaoou Tang
ICS
1993
Tsinghua U.
15 years 10 months ago
Static and Dynamic Evaluation of Data Dependence Analysis
—Data dependence analysis techniques are the main component of today’s strategies for automatic detection of parallelism. Parallelism detection strategies are being incorporate...
Paul Petersen, David A. Padua