Results 1 - 10 of 7,327

Table I. A simple augmented level set data structure supporting 3 optional fields in addition to the shared H-RLE grid and required level set values. The augmented level set structure, a unified implicit object representation, greatly simplifies the design and imple- mentation of algorithms that involve both level sets and other related data fields in areas such as level set-based fluid simulation, object deformation, collision detection and especially rendering.

in unknown title
by unknown authors 2006
Cited by 14

Table I. A simple augmented level set data structure supporting 3 optional fields in addition to the shared H-RLE grid and required level set values. The augmented level set structure, a unified implicit object representation, greatly simplifies the design and imple- mentation of algorithms that involve both level sets and other related data fields in areas such as level set-based fluid simulation, object deformation, collision detection and especially rendering.

in Hierarchical RLE level set: A compact and versatile deformable surface representation
by Ben Houston, Michael B. Nielsen, Christopher Batty, Ola Nilsson, Ken Museth, Frantic Films 2006

Table 1: The Procedure for Unifying Two KM-Terms.

in Building Domain Representations from Components
by Peter Clark, Bruce Porter 1996
"... In PAGE 5: ... The main challenge for a component-based representation falls on the composition operator: it must be capable of integrating information from various components, not simply collecting it. We implement this capability with graph uni cation, de ned in Table1 , based on a similar algorithm for psi-term uni cation [2]. Our objective with uni cation is to syntactically merge graphs in a way that corresponds to merging semantically related information.... ..."
Cited by 3

Table 1: The Procedure for Unifying Two KM-Terms.

in Building Domain Representations from Components
by Peter Clark, Bruce Porter 1996
"... In PAGE 5: ... The main challenge for a component-based representation falls on the composition operator: it must be capable of integrating information from various components, not simply collecting it. We implement this capability with graph uni cation, de ned in Table1 , based on a similar algorithm for psi-term uni cation [2]. Our objective with uni cation is to syntactically merge graphs in a way that corresponds to merging semantically related information.... ..."
Cited by 3

Table 6: Unified TLB

in Performance of Natural I/O Applications
by Stevan Vlaovic , Rich Uhlig 1999
"... In PAGE 10: ...55 MB), yet go has a higher mpi, as illustrated in Figure 6. Table6 displays the reference stream in greater detail. The first column contains the percentage of all code references that are to the kernel space.... In PAGE 28: ....38E-04 1.60E-04 3.31E-04 1.18E-03 2.87E-05 5.56E-05 3.48E-04 3.77E-05 7.29E-04 1.15E-03 1.15E-03 3.08E-04 1.19E-03 Table6... ..."
Cited by 2

Table 1: Unifying notation.

in Proof transformations from search-oriented into interaction-oriented tableau calculi
by Gernot Stenz, Wolfgang Ahrendt, Bernhard Beckert 1999
Cited by 1

Table 1: Unifying notation.

in Proof Transformations from Search-oriented into Interaction-oriented Tableau Calculi
by Gernot Stenz, Wolfgang Ahrendt, Bernhard Beckerr 1999
Cited by 1

Table 5: Unifying the recursion

in Catalan Traffic at the Beach
by Heinrich Niederhausen

Table 1. Unified model

in unknown title
by unknown authors

Table 1: From Application Domain to Planner Representation[31] Domain Analysis Model Component Planner Representation

in Generating Goal-oriented Test Cases
by Michael Scheetz, Anneliese von Mayrhauser, Eric Dahlman, Adele E. Howe 1999
"... In PAGE 3: ... The model is represented in the Unified Modeling Language (UML)[9], constraint rules, and state transition diagrams. Columns 1 and 2 of Table1 list the steps for the domain analysis and the domain model components generated at each step. (Column 3 will be discussed later.... ..."
Cited by 1
Results 1 - 10 of 7,327