1346 search results - page 175 / 270 » On the number of rectangular partitions |
DCC
2000
IEEE
15 years 2 months ago
2000
IEEE
We introduce a new image compression algorithm that allows progressive image reconstruction – both in resolution and in fidelity, with a fully embedded bitstream. The algorithm ...
ICCAD
2000
IEEE
15 years 2 months ago
2000
IEEE
–An FPGA switch box is said to be hyper-universal if it is routable for all possible surrounding multi-pin net topologies satisfying the routing resource constraints. It is desir...
GD
1998
Springer
15 years 2 months ago
1998
Springer
We describe a new approach for cluster-based drawing of very large graphs, which obtains clusters by using binary space partition (BSP) trees. We also introduce a novel BSP-type de...
113
click to vote
DMKD
1997
ACM
15 years 2 months ago
1997
ACM
Partitioning a large set of objects into homogeneous clusters is a fundamental operation in data mining. The k-means algorithm is best suited for implementing this operation becau...
DAC
1996
ACM
15 years 2 months ago
1996
ACM
Abstract A divide-and-conquer algorithm for computing the parametric yield of large analog circuits is presented. The algorithm targets applications whose performance spreads could...