1346 search results - page 81 / 270 » On the number of rectangular partitions |
ICCAD
2003
IEEE
2003
IEEE
Multi.Objective Hypergraph Partitioning Algorithms for Cut and Maximum Subdomain Degree Minimization
15 years 6 months ago
In this paper we present a family of multi-objective hypergraph partitioning algorithms based on the multilevel paradigm, which are capable of producing solutions in which both th...
IM
2007
14 years 9 months ago
2007
A local graph partitioning algorithm finds a cut near a specified starting vertex, with a running time that depends largely on the size of the small side of the cut, rather than...
ISM
2008
IEEE
15 years 4 months ago
2008
IEEE
We present a family of new macroblock partitions for H.264/AVC inter prediction. These modes allow a macroblock to be bipartitioned along a horizontal, vertical, or diagonal edge ...
106
click to vote
ICALP
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. We deal with two intimately related subjects: quasi-randomness and regular partitions. The purpose of the concept of quasi-randomness is to measure how much a given graph...
SAC
2006
ACM
15 years 3 months ago
2006
ACM
This paper addresses design exploration for protocols that are employed in systems with availability-consistency tradeoffs. Distributed data is modelled as states of objects repl...