### Table 2: Subdivisions

"... In PAGE 19: ...by subdivisions in Table2 is 886 whereas the subjects used only 112 of these as a response. This subset must be predicted by the model as well.... ..."

### Table 2: Subdivisions

"... In PAGE 14: ... In practice, it is not feasible to identify explicitly a subset of all possible codevectors, which have non-zero prior probability. For example, the number of notations which can be generated by subdivisions in Table2 is 886 whereas the subjects used only 112 of these as a response. This subset must be predicted by the model as well.... ..."

### Table 1: Subdivisions of the IT field

"... In PAGE 2: ... Why is this not happening? There are today over forty organized professional groups in computing and information technology. (See Table1 .) The IT-specific disciplines are the core technologies of computer science and engineering; the people working in these disciplines are called computing technologists.... ..."

### Table 1: Admission Samples.

2000

"... In PAGE 4: ... In other words, Admission : GPA = high ^ #28GRE = high _ Publications = true#29. An obvious question arises: #5CAre all the samples in Table1 equally useful for learning the target concept? quot; Apparently not, for several reasons. First, it seems that Pica apos;s record may not be useful since she was unlikely to be admitted #28i.... ..."

Cited by 14

### Table 1. Admission Complexity

"... In PAGE 5: ... The security of both TS-DSA and TS-Schnorr is based on discrete loga- rithm problem (DLP) and inherently the generation of a ran- dom value (and in turn interaction) among signers is required, while the security of TS-BLS is based on elliptic curve discrete logarithm problem (ECDLP) and has a fully non-interactive signature generation. Table1 compares the respective computation and commu- nication costs required for a new node to join the network. With TS-DSA, 2t + 1 signers are required in order to be able to tolerate t faults, while t + 1 partial shares are needed to reconstruct the secret share for joining.... In PAGE 5: ... Similarly, we can analyze the communica- tion rounds and the bandwidth required for TS-Schnorr and TS-BLS. As shown in Table1 , due to comparatively lesser communication, TS-BLS is more applicable for MANETs, in which the amount of communication is directly related to the battery power of the mobile devices (refer to [2]). On the other hand, since the partial signature computation with TS-BLS re- quires t + 1 expensive scalar-point-multiplication operations in elliptic curves, we expect that TS-Schnorr would perform better in terms of the computation time.... ..."

### Table 1. Comparison of subdivision levels for recursive and linear subdivision of the icoshedron.

"... In PAGE 4: ... The subdivision is linear in the number of subdivisions along each edge of the original icosahedron, rather than the commonly used recursive subdivisions. Any recursive subdivision has a corresponding linear subdivision, but most linear subdivisions have no corresponding recursive subdivision (see Table1 and Figure 3). a45 a45 a45 Figure 3.... ..."

### Table 1: Spatial subdivision statistics.

1998

"... In PAGE 6: ...1 Spatial Subdivision Results We first constructed the spatial subdivision data structure (cell ad- jacency graph) for each test model. Statistics from this phase of the experiment are shown in Table1 . Column 2 lists the number... ..."

Cited by 49

### Table 1: Spatial subdivision statistics.

"... In PAGE 6: ...1 Spatial Subdivision Results We first constructed the spatial subdivision data structure (cell ad- jacency graph) for each test model. Statistics from this phase of the experiment are shown in Table1 . Column 2 lists the number... ..."

### Table 1: Spatial subdivision statistics.

"... In PAGE 20: ...1 Spatial Subdivision Results We first constructed the spatial subdivision data structure (cell adjacency graph) for each test model. Statistics from this phase of the experiment are shown in Table1 . Column 2 lists the num- ber of input polygons in each model, while Columns 3 and 4 contain the number of cell regions and boundary polygons, respectively, generated by the spatial subdivision algorithm.... ..."