Sciweavers

1565 search results - page 60 / 313
» cluster 2006
Sort
View
ICMCS
2006
IEEE
142views Multimedia» more  ICMCS 2006»
15 years 3 months ago
FEMA: A Fast Expectation Maximization Algorithm based on Grid and PCA
EM algorithm is an important unsupervised clustering algorithm, but the algorithm has several limitations. In this paper, we propose a fast EM algorithm (FEMA) to address the limi...
Zhiwen Yu, Hau-San Wong
DKE
2006
83views more  DKE 2006»
14 years 9 months ago
Bulk insertion for R-trees by seeded clustering
We propose a scalable technique called Seeded Clustering that allows us to maintain R-tree indices by bulk insertion while keeping pace with high data arrival rates. Our approach ...
Taewon Lee, Bongki Moon, Sukho Lee
ICWMC
2006
IEEE
15 years 3 months ago
Base Station Assisted Hierarchical Cluster-Based Routing
Wireless sensor networks (WSNs) are commonly used for continuously monitoring applications. This paper investigates a base station assisted energy efficient routing for hierarchi...
Sajid Hussain, Abdul Wasey Matin
IPM
2007
158views more  IPM 2007»
14 years 9 months ago
Validation and interpretation of Web users' sessions clusters
Understanding users’ navigation on the Web is important towards improving the quality of information and the speed of accessing large-scale Web data sources. Clustering of users...
George Pallis, Lefteris Angelis, Athena Vakali
JCSS
2010
68views more  JCSS 2010»
14 years 8 months ago
Simplified proof of the blocking theorem for free-choice Petri nets
: Every cluster in a bounded and live free-choice system has a unique blocking marking. It can be reached by firing an occurrence sequence, which avoids any transition of the clust...
Joachim Wehler