### Table 3.1: Examples of Distinct, Uniquely Decodable and Prefix Free Codes

2004

### Table 3: Enumeration of segments for the example image

1995

"... In PAGE 14: ... = ;. The savings in representation increases as the number of regions in R increases. Table 4 depicts one possible sequence of T -re nement operations that could be derived. For convenience, Table3 names all of the segments of 1. We begin with C0 1, which corre- sponds to the set 1.... ..."

Cited by 5

### Table 3: Enumeration of segments for the example image

"... In PAGE 14: ... = ;. The savings in representation increases as the number of regions in R increases. Table 4 depicts one possible sequence of T -re nement operations that could be derived. For convenience, Table3 names all of the segments of 1. We begin with C0 1, which corre- sponds to the set 1.... ..."

### Table 1. The number of Web pages in the University data set. The pages were collected from the Web sites of the Computer Science departments at Cornell University, University of Texas at Austin, University of Washington and the University of Wisconsin.

2000

Cited by 40

### Table 1. The number of Web pagesin the University data set. The pages were collected from the Web sites of the Computer Science departments at Cornell University, University of Texas at Austin, University of Washington and the University of Wisconsin.

2000

Cited by 40

### Table 3. Precision for Language Enumeration and Segment Identification

### Table 1: Computational complexities for algorithms to compute the graph network measures.

"... In PAGE 4: ...Table 1: Computational complexities for algorithms to compute the graph network measures. Table1 summarises the computational complexity of the algorithms we need consider here in terms of the number of vertices N. In general we are severely limited in use of the algorithm for counting or enumerating the elementary circuits due to its intractability for anything but small networks of around 60 vertices and mean degree of around 6.... ..."

### Table 1: Pseudo-code for AND/OR enumeration

"... In PAGE 2: ... 2.2 AND/OR Reasoning Trees The procedure in Table1 performs AND/OR enumeration for an initial set of value assignments S at arbitrary signals in a combinational circuit. The technique in Table 1 results from routine make_all_implications() in [11] after removing... In PAGE 2: ...2 AND/OR Reasoning Trees The procedure in Table 1 performs AND/OR enumeration for an initial set of value assignments S at arbitrary signals in a combinational circuit. The technique in Table1 results from routine make_all_implications() in [11] after removing... In PAGE 3: ...Table 1: Pseudo-code for AND/OR enumeration We now introduce AND/OR trees constructed by the routine of Table1 . An AND/OR tree is a bipartite tree, one type of node is referred to as AND node, the other type is the OR node.... In PAGE 7: ... This routine is called fault_propaga- tion_learning() in [11]. Analogously, like the AND/OR enumeration of Table1 results from make_all_implications() [11], D-AND/OR enumeration results from fault_propagation_learning() by removing the statements to extract necessary assignments. The routine will be illustrated by an example in Section 3.... In PAGE 8: ...signments are enumerated in the usual way as given by Table1 , so that the AND/OR tree for the stuck-at-1 fault assumption at signal a results as shown in Figure 10. a d c f b e g k h i j q n l o p m Figure 9: Example circuit for D-AND/OR enumeration Note that for reasons of simplicity, in Figure 10, we only consider for inclusion in the AND/OR tree those unjustified gates that have a specified output signal, i.... ..."

### Table 2: Various cases of matching (disagreements) for the leading and assisting components of complex query. First and second columns enumerate matching possibilities for the leading and assisting components.

"... In PAGE 10: ... If a term can be neither matched against a semantic headers or delivers too many of them, this term can serve as a virtual one. In the Table2 below we analyze various cases of the satisfaction of a translation formula with two terms. In the complex sentence, we distinguish two parts: leading and assisting; these parts are frequently correlated with syntactic components of a sentence.... In PAGE 11: ... First and second columns enumerate matching possibilities for the leading and assisting components. Proposition 1: The rules ( Table2 ) for matching a translation formula as a conjunction with virtual semantic headers deliver the highest resultant accuracy, averaging through the respective set of queries (complex sentences). It is very important for observing the optimal domain structure that the clauses of semantic skeleton fill the gaps in between the semantic headers, which enforce the domain taxonomy.... In PAGE 15: ... gain(home(transfer,_,_),_,82108):-do(82108). Table2 Representation of an entity gain. ... ..."

### Table 1: Data from enumeration of reduced k n rectangles. 19

1999

"... In PAGE 18: ... Results for small squares The theoretical results given to date have dealt with the distribution of intercalates in large rectangles. As a counterpoint, in Table1 we display the results of a computer enumeration of small order Latin squares and rectangles; and the number of intercalates contained therein. Since intercalates survive permutations of the rows and columns it su ces to enumerate LR(k; n), the set of reduced k n Latin rectangles.... In PAGE 18: ... On the basis of Theorem 2 we might expect this value to be close to k. The actual values (to 4 decimal places) can be found in Table1 . We are also interested in the proportion of Latin rectangles which contain no intercalates, namely jS0j jL(k; n)j.... In PAGE 18: ... We are also interested in the proportion of Latin rectangles which contain no intercalates, namely jS0j jL(k; n)j. Theorem 1 suggests that this ratio will be approximately e? k, which is to say that the values in the nal column of Table1 should also be close to k. Since much attention has focused on N2 squares we provide separate counts of them in Table 2.... ..."

Cited by 3