845 search results - page 49 / 169 » Adaptive K-Means Clustering |
167
click to vote
PVLDB
2008
15 years 4 months ago
2008
Data clustering is a difficult problem due to the complex and heterogeneous natures of multidimensional data. To improve clustering accuracy, we propose a scheme to capture the lo...
179
click to vote
EUROCAST
2009
Springer
16 years 25 days ago
2009
Springer
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising in particular in network design. There exist various exact and metaheuri...
167
click to vote
ICDS
2009
IEEE
16 years 1 months ago
2009
IEEE
—In a wireless sensor network application for tracking multiple mobile targets, large amounts of sensing data can be generated by a number of sensors. These data must be controll...
171
click to vote
IPCCC
2007
IEEE
16 years 17 days ago
2007
IEEE
LEACH (Low Energy Adaptive Clustering Hierarchy) [1] is one of the popular cluster-based structures, which has been widely proposed in wireless sensor networks. LEACH uses a TDMA ...
156
click to vote
IPPS
2006
IEEE
16 years 9 days ago
2006
IEEE
High-performance computing clusters running longlived tasks currently cannot have kernel software updates applied to them without causing system downtime. These clusters miss oppo...