### Table 2. Huge instances solved by M*. The sign #0F marks cases when the LP relaxation is non-integer.

2003

"... In PAGE 4: ...nteger, i.e. path/threading defining, for a large set of in- stances. Table2 contains results obtained when aligning the biggest queries in FROST data base. What is seen is that even for polytopes of at least 10 39 vertices, the objective function of the relaxed problem of (13)-(18), counting more than million variables, attains its mini- mum at a threading defining vertex.... In PAGE 6: ... We see from table 1 that M* significantly out- performs the b amp;b algorithm. Table2 gives results on instances never attempted before. Table 4 illustrates the impact of the split and conquer strategy on the total running time, while table 5 presents experiments from its parallelization.... ..."

Cited by 3

### Table 1. Derivatives and their inverses: reconstructions by integration. D is the dimension. p is the characteristic (also non-integer) power of frequency in the Derivative Transfer Function. Note that for p=0 the Generalized Vector Gradient and its Inverse are equal to the Vector Hilbert Transform and its Inverse as discussed in [4].

2001

"... In PAGE 4: ...ccording to the chain (cf. fig. 1c) {Derivative operator, Non-linear Point Processing, Inverse Derivative operator} a variety of enhancement methods can be constructed. Table1 gives a survey of the derivatives to be chosen. The integrations are up to zero-derivative terms.... ..."

Cited by 3

### Table II Non-Integer Indoor Cluster Sizes C2 C1 Omnidirectional Sector Cell

1998

Cited by 1

### Table 2: Legitimate non-integer LTPD values and LTP resolution in the 5.6 kbps VSELP half-rate GSM codec

"... In PAGE 22: ... The 4 encoding bits allow for a maximum di#0Berence of #5B-8, +7#5D positions with respect to the previous LTPD value. The legitimate LTPD values are listed in Table2 . Observe in the table that for lowLTPD values a #0Cner resolution is used and the highest resolution is assigned for the range 23 :::#2834 + 5 6 #29, corresponding to a pitch lag of between 2:875 :::4:35ms or pitch frequency of 230-348 Hz.... ..."

### Table 7: Deployed Application Landscape [20], [21], [22]

"... In PAGE 6: ...able 6: Online Services Clusters............................................................................................... 19 Table7 : Deployed Application Landscape [20], [21], [22].... ..."

### Table 2 shows the signal to noise ratio for the errors introduced by synchronous averaging using a non- integer rotation period. The table also shows the allowable average deviation of T in samples; this is calculated by solving equation 5,

"... In PAGE 16: ...1 Rolling Element 19 1.4 Table2 : Signal to noise ratio due to error in sampling time... ..."

### Table 4: The calculus LHO

"... In PAGE 19: ... We call the resulting calculus Local Higher-Order -calculus, brie y LHO . Its syntax and operational semantics are de ned by adding the productions and rules in Table4 to those of L . Passing a process is like passing a parameterless procedure.... ..."

### Table 4: The calculus LHO

1999

"... In PAGE 19: ... We call the resulting calculus Local Higher-Order -calculus, brie y LHO . Its syntax and operational semantics are de ned by adding the productions and rules in Table4 to those of L . Passing a process is like passing a parameterless procedure.... ..."

### Table 3: Distribution of static operation widths. Application 1-4 5-8 9-12 13-16 17-20 21-24 25-28 29-32

2001

"... In PAGE 30: ... This causes the rapid, non-recursive algorithm to be used for these experiments. Toprovide some insightinto the width characteristics of the applications, a histogram of the static operation widths is presented in Table3 . Each cell in the table contains the fraction of static operations for a particular application whose width is within the speci ed range.... In PAGE 32: ... The largest reduction occurs for cell, where the total cost is reduced by 85%. This application is dominated by operations that are 1-4 bits (89% from Table3 ). Hence, there are a large number of opportunities to synthesize narrow hardware to reduce cost.... In PAGE 33: ...other extreme behavior occurs for matmul, where no cost reduction is observed. As shown in Table3 , all of its operations are 32 bit, hence there is no opportunityforbitwidth-sensitive synthesis to yield any cost reductions. 6.... In PAGE 33: ... This application su ers from poor sharing of hardware using bitwidth analysis alone. Almost half of the operations in chain are 1-4 bits (see Table3 ), yet less than a 5% reduction in cost is observed after bitwidth analysis (see Figure 9). Narrow and wide operations are accidentally scheduled onto common FUs resulting in most of the hardware being wide.... ..."

Cited by 20

### Table 1. First-order logic part of the ODL calculus.

2006

"... In PAGE 10: ... Yet, rule applications for rst- order reasoning and program reasoning are not separated but intertwined. For rst-order and propositional logic standard rule schemata are listed in Table1 , including an integer induction scheme. Within the rules for the program logic part (Table 2), state update rules R29{R30 constitute a peculiarity of ODL and will be discussed after de ning rule applications.... ..."

Cited by 7