### Table 15: Numerical results for the problem of partitioning integer sequence a = (1, 2, 3, 20, 5, 6, 7, 10, 11, 77, 3)

2007

### Table 12. Double Partition vs. Multiple Partition n DO Method with Double Partition Multiple Partition = dpn e k = 2

"... In PAGE 16: ... Because both and k have to be integer we have to assume = l 3 pn2 m and k = lp m. A comparison between the performance of the optimal delay scheme based on double partition and the the optimal delay scheme based on mul- tiple partition is given in Table12 . The strange fact that in the case of 16 bit operands the mul- tiple partition provides a delay greater then the delay provided by the double partition is a con- sequence of the error we introduced in the opti- mization in Theorem 3 by discarding the ceiling operators.... ..."

### Table II: Partitions of disjoint looping sequences. Sequence T Partitioning P

### Table 2: Partitioning of the Training Sequences.

"... In PAGE 3: ... The problem of STR has now been de-coupled from the remaining problem. Only a set of four sequences #28d 1 ,d 4 , see Table2 #29 needs to be found to discriminate to the four higher modulation schemes. Note that the Walsh-Hadamard sequences are not a good solution here.... ..."

### Table 2. Average size of basic blocks and instruction streams on integer benchmarks

### Table 7.8 The number of edges cut by the equal-sized partitions output by the various algorithms (see Section 7.4). Note that since the Eppstein mesh is weighted, the cut cost is not an integer.

2006

Cited by 3

### Table 5: Hankel transforms of some integer sequences

Cited by 1

### Table 1: Experiment results for 3 video sequences (THR: dynamic threshold streaming, RT: realtime adaptation, COMP: composed algorithm, OPT: optimal adaptation algorithm)

2005

"... In PAGE 70: ...n Section 3.4.2. Table1 shows the performance of all algorithms. In all cases, the optimal adaptation algorithm exhibits the smallest WAQT, since the algorithm is optimized to minimize quality variability.... ..."

### Table 1: Partitioning Algorithm

"... In PAGE 5: ... No two data nodes share an edge and no two process nodes share an edge. Table1 summarizes our partitioning heuristics. We then traverse the graph, generating a partition for each process node, easily identifying the data nodes that are connected to it, and use the graph to guide data layout based on rules provided in Table 1.... ..."