1346 search results - page 34 / 270 » On the number of rectangular partitions |
HPDC
2005
IEEE
14 years 1 months ago
2005
IEEE
good data partitioning scheme is the need of the time. However it is very diflcult to arrive at a good solution as the number of possible dutupartitionsfor a given real lifeprogra...
MICCAI
2006
Springer
14 years 8 months ago
2006
Springer
Abstract. A new method is proposed to unambiguously define a geometric partitioning of 3D models of female thorax. A breast partitioning scheme is derived from simple geometric pri...
EUROPAR
2004
Springer
14 years 24 days ago
2004
Springer
We propose an architecture that consists of a ring of clusters for distributed mutual exclusion algorithms in mobile networks. The mobile network is partitioned into a number of cl...
JMLR
2010
13 years 2 months ago
2010
Hartigan's method for k-means clustering is the following greedy heuristic: select a point, and optimally reassign it. This paper develops two other formulations of the heuri...
MOBIHOC
2008
ACM
14 years 7 months ago
2008
ACM
Constructing sensor barriers to detect intruders crossing a randomly-deployed sensor network is an important problem. Early results have shown how to construct sensor barriers to ...