1390 search results - page 127 / 278 » Self-Sizing of Clustered Databases |
110
Voted
EDBT
2004
ACM
16 years 1 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...
107
click to vote
DASFAA
2008
IEEE
15 years 8 months ago
2008
IEEE
Clustering time series is usually limited by the fact that the length of the time series has a significantly negative influence on the runtime. On the other hand, approximative c...
125
click to vote
ICPR
2008
IEEE
15 years 8 months ago
2008
IEEE
This paper proposes a novel algorithm for categorization of action video sequences using unsupervised dual clustering. Given a video database, we extract motion information of act...
VLDB
2001
ACM
15 years 6 months ago
2001
ACM
Cache Fusion TM is a fundamental component of Oracle’s Real Application Cluster configuration, a shared-cache clustered-database architecture that transparently extends databas...
195
click to vote
ICDE
2004
IEEE
16 years 3 months ago
2004
IEEE
In this paper, we will look at substructure clustering of sequential 3d objects. A sequential 3d object is a set of points located in a three dimensional space that are linked up ...