6181 search results - page 557 / 1237 » Transactional Cluster Computing |
237
click to vote
GECCO
2009
Springer
16 years 1 months ago
2009
Springer
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising, for example, in network design when quality of service is of concern. ...
223
click to vote
ICDE
2007
IEEE
16 years 1 months ago
2007
IEEE
Moving objects are becoming increasingly attractive to the data mining community due to continuous advances in technologies like GPS, mobile computers, and wireless communication ...
203
click to vote
DCOSS
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. In this paper, we study the two-tiered wireless sensor network (WSN) architecture and propose the optimal cluster association algorithm for it to maximize the overall net...
292
click to vote
ICDM
2006
IEEE
16 years 1 months ago
2006
IEEE
In spite of the initialization problem, the ExpectationMaximization (EM) algorithm is widely used for estimating the parameters in several data mining related tasks. Most popular ...
161
click to vote
SBACPAD
2005
IEEE
16 years 22 days ago
2005
IEEE
Clustered architectures which intend to process data within a localized PE are one of the approaches to increase the performance under the difficulties of the wire delay problems...