Lines Matching refs:obtained
149 The $\vec K_i$ can be obtained by solving a number of
216 through pivoting until a valid solution is obtained.
682 while the points used in this algorithm are obtained by performing
1147 The approximation of $k \, \Delta_i(\vec s)$ can therefore be obtained
1354 can be obtained. That would be
1363 The approximation $T$ for the transitive closure $R^+$ can be obtained
1458 The components can be obtained from the graph by applying
1698 obtained. If the resulting partition consists of a single part,
1992 Such an overapproximation can be obtained by computing strides,
2021 In this case, ${\cal C}(R_i,D)$ can be obtained by
Indexes created Tue Sep 22 00:26:15 UTC 2026