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...
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 ...
Kenneth Vermeirsch, Jan De Cock, Stijn Notebaert, ...
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...
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...
er provides new techniques for abstracting the state space of a Markov Decision Process (MDP). These techniques extend one of the recent minimization models, known as -reduction, ...