786 search results - page 54 / 158 » An Efficient k-Means Clustering Algorithm: Analysis and Impl... |
RTSS
1994
IEEE
14 years 12 days ago
1994
IEEE
In this paper we present four new on-line algorithms for servicing soft aperiodic requests in real-time systems, where a set of hard periodic lash is scheduled using the Earliest ...
ICDE
2008
IEEE
14 years 9 months ago
2008
IEEE
Subspace clustering has attracted great attention due to its capability of finding salient patterns in high dimensional data. Order preserving subspace clusters have been proven to...
VLDB
1998
ACM
14 years 14 days ago
1998
ACM
Many applications compute aggregate functions over an attribute (or set of attributes) to find aggregate values above some specified threshold. We call such queries iceberg querie...
MICCAI
2007
Springer
14 years 9 months ago
2007
Springer
A fundamental problem when computing statistical shape models is the determination of correspondences between the instances of the associated data set. Often, homologies between po...
IPPS
2008
IEEE
14 years 2 months ago
2008
IEEE
We present SNAP (Small-world Network Analysis and Partitioning), an open-source graph framework for exploratory study and partitioning of large-scale networks. To illustrate the c...