### Table 1 gives an indication of the range of I (obtained experimentally from the simulation performed on our test data). In our following results, we have imposed the constraint I 10 and the complexity values are given for I = 10. Note that the complexity values given correspond to the peak values and the average complexity would be somewhat lower. Entropy Coding Hu man Coding

2002

"... In PAGE 13: ... Table1 : Number of iterations (1D case) Table (2) shows the numerical results of the proposed quantizers at di erent bit rates. The rst column is based on a constraint on the total self information (SI).... ..."

### Table 1: Computational complexity of constraint planning problems. Cycles in the constraint

"... In PAGE 5: ... Indeed, a general computational result states that a restriction imposed on a solution does not necessarily make the corresponding problem easier [Papadimitriou 94]. Table1 shows the computational complexity of some existing constraint planning problems. 4 An NP-complete planning problem with method restriction De nition 3 The method restriction imposes that every constraint method of a given problem must use all of the variables in the constraint either as an input or an output variable.... ..."

### Table 1. Constraints imposed by regulation.

### Table 3. Constraints imposed by the channel.

### Table 1. Constraints imposed by regulation.

### Table 3. Constraints imposed by the channel.

### Table 1: Formal de nition of imposed constraints

2001

"... In PAGE 9: ...Table1 using the notation introduced in this section. In this context, RDF data can be atomic values (e.... In PAGE 10: ... Finally, built-in property types such as rdfs:seeAlso, rdfs:isDefinedBy, rdfs:comment, rdfs:label can be easily represented in our model, but due to space limitations they are not considered in this paper. 10 Constraint C3 of Table1 ensures that rdfs:domain and rdfs:range are not any more relations as in the current RDF M amp;S and RDFS speci cations [15, 4].... In PAGE 11: ... Currently VRP is a command line tool with various options to generate a textual representation of the internal model (either graph or triple based). The most distinctive feature of VRP is its abilitytoverify the constraints speci ed in the RDF M amp;S and RDFS speci cations [15, 4] as well as the additional constraints weintroduced previously (see Table1 ). This permits the validation of both the RDF descriptions against one or more RDFS schemas, and the schemas themselves.... ..."

Cited by 68

### Table 1: Table of constraints imposed on web services

1061

"... In PAGE 17: ...Constraints / requirements direct from Informal Sections In Table1 we see the constraints extracted from the informal analysis along with the section numbers they originated from. Req Description From sec- tions C1 All component ports must be accessible to others via a network 3.... ..."