Sciweavers

340 search results - page 25 / 68
» Clustering with Lower Bound on Similarity
Sort
View
ICDM
2007
IEEE
176views Data Mining» more  ICDM 2007»
15 years 1 months ago
A Compact Representation of Spatio-Temporal Data
As technology advances we encounter more available data on moving objects, which can be mined to our benefit. In order to efficiently mine this large amount of data we propose an ...
Sigal Elnekave, Mark Last, Oded Maimon
SDM
2012
SIAM
247views Data Mining» more  SDM 2012»
12 years 12 months ago
Image Mining of Historical Manuscripts to Establish Provenance
he recent digitization of more than twenty million books has been led by initiatives from countries wishing to preserve their cultural heritage and by commercial endeavors, such a...
Bing Hu, Thanawin Rakthanmanon, Bilson J. L. Campa...
RTAS
2005
IEEE
15 years 3 months ago
On Schedulability Bounds of Static Priority Schedulers
—Real-time systems need to use the schedulability test to determine whether or not admitted tasks can meet their deadlines. The utilization based schedulability test is the most ...
Jianjia Wu, Jyh-Charn Liu, Wei Zhao
NIPS
2001
14 years 11 months ago
Spectral Relaxation for K-means Clustering
The popular K-means clustering partitions a data set by minimizing a sum-of-squares cost function. A coordinate descend method is then used to nd local minima. In this paper we sh...
Hongyuan Zha, Xiaofeng He, Chris H. Q. Ding, Ming ...
IPPS
2010
IEEE
14 years 7 months ago
Scalability analysis of embarassingly parallel applications on large clusters
This work presents a scalability analysis of embarrassingly parallel applications running on cluster and multi-cluster machines. Several applications can be included in this catego...
Fabrício Alves Barbosa da Silva, Hermes Sen...