391 search results - page 4 / 79 » Sortabilities of Partition Properties |
IMR
2003
Springer
14 years 17 days ago
2003
Springer
The 8-tetrahedra longest-edge (8T-LE) partition of any tetrahedron is defined in terms of three consecutive edge bisections, the first one performed by the longest-edge. The ass...
ICPR
2008
IEEE
14 years 1 months ago
2008
IEEE
In this paper, we introduce an incremental nested partition algorithm for finding the inner structuralization of dynamic datasets. Here we use three partition criteria that allow...
DAC
2001
ACM
14 years 8 months ago
2001
ACM
Trends in the semiconductor industry towards extensive design and code reuse motivate a need for adequate Intellectual Property Protection (IPP) schemes. We offer a new general IP...
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...
SRDS
2000
IEEE
13 years 11 months ago
2000
IEEE
Avoiding the partitioning of a cluster into cliques that are not able to communicate with each other is an important issue in the time-triggered communication protocol TTP/C. This...