### Table 2: Properties of the MPEG-4 decoding tasks that determine the mapping onto HW or SW.

2002

"... In PAGE 8: ....1. Processing characteristics To come to a partitioning of the functionality in HW and SW, we separate the MPEG-4 decoder functions into tasks with self-contained functionality and clear interfaces. Table2 shows an overview of these tasks, including their processing characteristics. As explained in Section 2.... In PAGE 10: ... VLD context calculation 16 157 16 16 shape decoder 16 16 down samp up samp reference BAB memory CAD current bab mem Inverse scan AC/DC prediction MB stripe memory iQuant iDCT VOP reconstr up samp padding demux 16 27 49 362 run-length decode reference VOP memory 500 313 94 VLD Variable Length Decoder BAB Binary Alpha Block CAD Context-based Arithmetic Decoder SW implementation HW implementation memory 353 357 362 362 313 70 Figure 5: Block diagram of Video Object Plane decoder, including data transport bandwidths (MByte/s). The bottom row in Table2 represents the rendering and composition of all objects into the final scene. The first part of this functionality comprises a BIFS browser, analog to a VRML browser.... ..."

Cited by 5

### Table 1: Routines with nested parallelism. Both the inner part and the outer part can be executed in parallel.

1993

"... In PAGE 9: ... The implementation of the permute function on a distributed-memory parallel machine could use its communication network, and the implementation on a shared-memory machine could use an indirect write into the memory. Table1 lists the vector functions available in Nesl. A subset of the functions (the stared ones) form a complete set of primitives.... In PAGE 10: ...int In this expression there is parallelism both within each +-reduce, since the vector function has a parallel implementation, and across the three instances of +-reduce, since over is de ned such that all instances can run in parallel. Table1 lists several examples of routines that could take advantage of nested parallelism. Nested parallelism also appears in most divide-and-conquer algorithms.... ..."

Cited by 116

### Table 1: Routines with nested parallelism. Both the inner part and the outer part can be executed in parallel.

1993

"... In PAGE 9: ... The implementation of the permute function on a distributed-memory parallel machine could use its communication network and the implementation on a shared-memory machine could use an indirect write into the memory. Table1 lists some of the sequence functions available in Nesl. A subset of the functions (the starred ones) form a complete set of primitives.... In PAGE 12: ...Outer Parallelism Inner Parallelism Quicksort For lesser and greater Quicksort elements Mergesort For rst and second Mergesort half Closest Pair For each half of Closest Pair space Strassen apos;s For each of the 7 Strassen apos;s Matrix Multiply sub multiplications Matrix Multiply Fast For two sets of Fast Fourier Transform interleaved points Fourier Transform Table 2: Some divide and conquer algorithms. Table1 lists several examples of routines that could take advantage of nested parallelism. Nested parallelism also appears in most divide-and-conquer algorithms.... In PAGE 16: ... The work complexity for most of the sequence functions is simply the size of one of its arguments. A complete list is given in Table1 . The size of an object is de ned recursively: the size of a scalar value is 1, and the size of a sequence is the sum of the sizes of its elements plus 1.... ..."

Cited by 87

### Table 2. The statistical results for dynamic manipulations.

1997

"... In PAGE 11: ... links that needed changes and the link update time among the three different models. Statistics are presented in Table2 to quantitatively illustrate the information obtained. We also tested the box room scene for the case of a decrease in the total net energy.... In PAGE 11: ... 10. The top part of Table2 lists the number of input surfaces, input objects, resulting elements, resulting links and its constituent parts, Obj.... In PAGE 11: ... The results show that the proposed progressive strategy effectively avoided unnecessary links, thus reducing the total rendering time. The bottom section of Table2 shows that the proposed dynamic framework rejected from 39.62% to 90.... In PAGE 11: ...inks in the scenes; hence, only 9.67% to 60.38% of the links required further visibility computation. The bottom line of Table2 gives link update times, including the time needed for the reject test, visibility computation, and image updating, for each scene. We can conclude that the link updating time was in proportion to both the model complexity and the number of resulting links, and was relatively small compared to the time needed for refine-... ..."

### Table 4: Precondition formulae for the true-branch part of atomic program conditions that manipulate linked lists.

2000

Cited by 70

### Table 2. Stable equilibria of rectangular parts R10 and R20 for the manipulation vocabulary AB, BA, CD, and DC.

### Table 2: Stable equilibria of rectangular parts R10 and R20 for the manipulation vocabulary AB, BA, CD, and DC.

"... In PAGE 24: ... This gives us a total of mE = 4 2 = 8 discrete equilibria for R10 and R20, when using the nite eld operators AB, BA, CD, and DC. All equilibria are shown in Table2 (compare with Table 1 and Figure 14). Finally, any one of the operators AB, BA, CD, and DC uniquely orients R30, yielding trivial one-step plans to uniquely pose R30.... ..."

### Table 2: Stable equilibria of rectangular parts R10 and R20 for the manipulation vocabulary AB, BA, CD, and DC.

"... In PAGE 25: ... This gives us a total of mE = 4 2 = 8 discrete equilibria for R10 and R20, when using the nite eld operators AB, BA, CD, and DC. All equilibria are shown in Table2 (compare with Table 1 and Figure 14). Finally, any one of the operators AB, BA, CD, and DC uniquely orients R30, yielding trivial one-step plans to uniquely pose R30.... ..."

### Table 2: Stable equilibria of rectangular parts R10 and R20 for the manipulation vocabulary AB, BA, CD, and DC.

"... In PAGE 23: ... This gives us a total of mE = 4 2 = 8 discrete equilibria for R10 and R20, when using the nite eld operators AB, BA, CD, and DC. All equilibria are shown in Table2 (compare with Table 1 and Figure 14). Finally, any one of the operators AB, BA, CD, and DC uniquely orients R30, yielding trivial one-step plans to uniquely pose R30.... ..."