1346 search results - page 202 / 270 » On the number of rectangular partitions |
ICTAI
2006
IEEE
15 years 3 months ago
2006
IEEE
We propose two Euclidean minimum spanning tree based clustering algorithms — one a k-constrained, and the other an unconstrained algorithm. Our k-constrained clustering algorith...
INFOCOM
2006
IEEE
15 years 3 months ago
2006
IEEE
— Because a delay tolerant network (DTN) can often be partitioned, routing is a challenge. However, routing benefits considerably if one can take advantage of knowledge concerni...
IPPS
2006
IEEE
15 years 3 months ago
2006
IEEE
The problem of data broadcasting over multiple channels consists in partitioning data among channels, depending on data popularities, and then cyclically transmitting them over ea...
SKG
2006
IEEE
15 years 3 months ago
2006
IEEE
Data Grid is one of the important research subjects in the field of Grid Computing. To get a high efficiency of the system, this paper proposes a set of novel multicast algorithms...
ASPLOS
2006
ACM
15 years 3 months ago
2006
ACM
Spatial Computing (SC) has been shown to be an energy-efficient model for implementing program kernels. In this paper we explore the feasibility of using SC for more than small k...