### Table 2: Correct classification in percent for some of the ordinary first (left) and second (right) order texture features. Subscript: pyramid level 0 to 3.

"... In PAGE 6: ...resentation methods which gave best results for the single best features (mean, median, first and third quartile). The best feature pairs were combinations of the Diagonal Moment at different levels in the pyramid, as shown in Table2 , and these combinations gave a correct... ..."

### Table 2. Matrices required to describe a system of rst order in time (left) and second order in time (right)

"... In PAGE 7: ... Matrices and vectors not given take default values; matrices with zero size in one dimension should also be not speci ed. The matrices required for (5) and (6) and the default values are shown in Table2 . E, A, B, b, F, C, D, d, G, M, K, x0 and v0 should be constant, i.... ..."

### Table 3 Ordered Probit of Educational Attainment of Black Women with Right Censoring

Cited by 1

### Table 2: Basic (left) and order-constrained (right) estimates for the second example

2005

"... In PAGE 5: ... The resulting order- constrained estimates are summarised in the right part of Table 1. As a second example, we consider the basic estimates in the left part of Table2 . The basic estimates again violate the order constraints (1) and (2), but this time they cannot be resolved simultaneously by averaging ^ p over just one of the sets of cells f( a; b); ( a; b)g and f( a; b); (a; b)g.... ..."

Cited by 1

### Table 3.7 shows the symbols that LaTEX will recognise as delimiters, i.e. symbols that may follow a \left or a \right. Note that you have to use \left\{ and \right\} in order to get scaled braces.

### Table 3.7 shows the symbols that LATEX will recognise as delimiters, i.e. symbols that may follow a \left or a \right. Note that you have to use \left\{ and \right\} in order to get scaled braces.

in Contents

1992

### Table 3. PFA data from the 17 transects used in this study, in chronological order (left to right). 2

1997

"... In PAGE 11: ...ata (i.e., vectors comprising mainly zeroes with a few ones, e.g., parasitic species, PA in Table3 ). The inclusion of these variables in a statistical model may greatly reduce the residuals associated with the 22 non-zero entries, so that the variables appear to be statistically significant, even though the result is most probably due to chance.... In PAGE 12: ...g., species with pendulous leaves, PE in 2 Table3 ), or which exhibited an exceptionally strong leverage in the fitted model (e.g.... ..."

Cited by 1

### Table 1. Time and node consumption of pns and various configurations of mc-pns relative to pns. Each table presents the ten best ranked settings of the 36 parameter settings. Left: ordered by a factor representing the gain of speed. Right: ordered by a factor representing the decrease of nodes.

"... In PAGE 7: ... The gaintime(pfast) = 2.05 indicating that it is about twice as fast as the pns benchmark (see Table1 ).... In PAGE 10: ... The number of expansions decreases with the intensity of evaluation because the heuristic is more reliable and prunes more nodes. This is reflected by the experimental finding that nodes with thorough evaluation (large N and large la) reach their goals with few expansions ( Table1 ). But more inten- sive the evaluation requires more time.... ..."

### Table 1. Structural properties of graphs (left) and run-times for d1 and d2 coloring using various vertex orderings (right).

2004

"... In PAGE 6: ... Due to space limitations, we only provide results for two representative graphs from our testbed, both of which are from nite element methods [13]. The left part of Table1 lists relevant structural properties of these graphs. The column labeled density shows the quantity 2jEj jV j (jV j 1).... In PAGE 6: ... The column marked gives the maximum vertex degree while column gives the average vertex degree in the graph. In the right part of Table1 , the columns labeled Natural, Random, and RCM show the time (in seconds) used by a sequential greedy coloring algorithm when the vertices are visited in their natural order, in a random order, and in the reverse Cuthill-McKee order, respectively. For each ordering, run-times for... In PAGE 7: ...7 Table1 shows that a random vertex ordering destroys any available locality and hence increases the running time by a factor of nearly three for d1-coloring and by a factor of four for d2-coloring. The RCM ordering reduces the running time by 31% and 20% for the d1-coloring and by 40% and 37% for the d2-coloring.... ..."

Cited by 5

### Table 1. Structural properties of graphs (left) and run-times for d1 and d2 coloring using various vertex orderings (right)

2004

"... In PAGE 6: ... For each ordering, run-times for a d1-coloring and a d2-coloring are provided. Table1 shows that a random vertex ordering destroys any available locality and hence increases the running time by a factor of nearly three for d1-coloring and by a factor of four for d2-coloring. The RCM ordering reduces the running time by 31% and 20% for the d1-coloring and by 40% and 37% for the d2-coloring.... ..."

Cited by 5