494 search results - page 53 / 99 » Optimal Carpet Cutting |
IPPS
1998
IEEE
15 years 4 months ago
1998
IEEE
A non-redundant fault-tolerant broadcasting algorithm in a faulty k-ary n-cube is designed. The algorithm can adapt up to 2n,2 node failures. Compared to the optimal algorithm in a...
ICCAD
1993
IEEE
15 years 4 months ago
1993
IEEE
In this paper, we present an integrated approach to synthesis and mapping to go beyond the combinatorial limit set up by the depth-optimal FlowMap algorithm. The new algorithm, na...
101
click to vote
JGAA
2000
14 years 11 months ago
2000
This paper considers problems of the following type: given an edgeweighted k-colored input graph with maximum color class size c, find a minimum or maximum c-way cut such that eac...
ICDM
2010
IEEE
14 years 9 months ago
2010
IEEE
An idealized clustering algorithm seeks to learn a cluster-adjacency matrix such that, if two data points belong to the same cluster, the corresponding entry would be 1; otherwise ...
SECON
2010
IEEE
14 years 9 months ago
2010
IEEE
Abstract-- Spatial dissemination is a specific form of information dissemination that enables mobile users to send information to other mobile users who are or will appear at a spe...