Sciweavers

2600 search results - page 190 / 520
» Clustering with or without the Approximation
Sort
View
KDD
2010
ACM
208views Data Mining» more  KDD 2010»
15 years 5 months ago
Towards mobility-based clustering
Identifying hot spots of moving vehicles in an urban area is essential to many smart city applications. The practical research on hot spots in smart city presents many unique feat...
Siyuan Liu, Yunhuai Liu, Lionel M. Ni, Jianping Fa...
KDD
2007
ACM
231views Data Mining» more  KDD 2007»
16 years 7 months ago
Xproj: a framework for projected structural clustering of xml documents
XML has become a popular method of data representation both on the web and in databases in recent years. One of the reasons for the popularity of XML has been its ability to encod...
Charu C. Aggarwal, Na Ta, Jianyong Wang, Jianhua F...
KDD
2007
ACM
276views Data Mining» more  KDD 2007»
16 years 7 months ago
Nonlinear adaptive distance metric learning for clustering
A good distance metric is crucial for many data mining tasks. To learn a metric in the unsupervised setting, most metric learning algorithms project observed data to a lowdimensio...
Jianhui Chen, Zheng Zhao, Jieping Ye, Huan Liu
SSDBM
2005
IEEE
132views Database» more  SSDBM 2005»
16 years 3 days ago
Co-Scheduling of Computation and Data on Computer Clusters
Scientific investigations have to deal with rapidly growing amounts of data from simulations and experiments. During data analysis, scientists typically want to extract subsets o...
Alexandru Romosan, Doron Rotem, Arie Shoshani, Der...
SIGMETRICS
1999
ACM
15 years 11 months ago
Availability and Utility of Idle Memory in Workstation Clusters
In this paper, we examine the availability and utility of idle memory in workstation clusters. We attempt to answer the following questions. First, how much of the total memory in...
Anurag Acharya, Sanjeev Setia