### TABLE 3. Radiological Diagnoses of Patients With TLE Without Psychopathology (TLE, n H11540 24), TLE and Postictal Psychosis (PIP, n H1154015 ) and TLE and Interictal Psychosis (SLPE, n H11540 11)

2002

### Table 1: Triangles evolution in the 4T-LE partition

"... In PAGE 7: ... Above equations can be solved by writing in their matricial form, since the associated matrix is diagonalizable, [5], and this lead to the following solution: Therefore, To complete the proof, we now consider the case of an initial Type 2 obtuse triangle t0. Table1 presents the number of distintic types of triangles generated by the 4T-LE iterative refinement of t0. Table 1: Triangles evolution in the 4T-LE partition... In PAGE 7: ... For example, after second refinement are generated 4 triangles similar to t0, 8 triangles similar to t1 and 4 new triangles similar to t2. From Proposition 5 (2) and Figure 7 we derive Table1 , in which the following relation holds: and in terms of binomial coeefficients: . On the other hand, the number of terminal triangles TTn after the k refinement stage with n gt;k hold: .... ..."

### Table 2: Triangle evolution in the 4T-LE partition.

2003

"... In PAGE 6: ... Solving the recurrence relations 2, 3 we get: Tn = 4n 2n (4) Therefore, lim n!1 B( n) = lim n!1 Tn Nn = 1 To complete the proof, we now consider the case of an initial Type 2 obtuse triangle t0. Table2 presents the number of distinct types of triangles generated by the 4T-LE iterative re nement of t0. We denote by tn j the number of triangles of similarity class tj, j = 0; 1; 2; ; k at stage n of re nement.... ..."

Cited by 4

### TABLE IX COMPARISON OF TLE FOR EIFEL AND DualRTT.

### Table 2. A list of counting constraints that are intractable to propagate with GAC.

2004

"... In PAGE 5: ... We use the basic tools of computational complexity to show their tractability or intractability. Table2 gives some of the intractability results we obtained for counting constraints on integer variables. Proofs are in [3].... ..."

Cited by 7

### Table 2. A list of counting constraints that are intractable to propagate with GAC.

2004

"... In PAGE 5: ... We use the basic tools of computational complexity to show their tractability or intractability. Table2 gives some of the intractability results we obtained for counting constraints on integer variables. Proofs are in [3].... ..."

Cited by 7

### Table 2. A list of counting constraints that are intractable to propagate with GAC.

2004

"... In PAGE 5: ... We use the basic tools of computational complexity to show their tractability or intractability. Table2 gives some of the intractability results we obtained for counting constraints on integer variables. Proofs are in [3].... ..."

Cited by 7