Results 1 - 10 of 25,978

Table 6: The function relax.

in Continuous k-Nearest Neighbor Queries in Road Networks Using Oracle Spatial Abstract
by Michael Sig Birkmose, Lars Haugaard Kristensen, Nguyen Thu Hang, Hans Hvelplund Odborg 2003
"... In PAGE 11: ... Therefore, if we flnd a non resident vertex, we retrieve all the segments, moving objects, and connections in the cell that the vertex is located in (lines 11-13). The algorithm uses the functions relax and ini- tialize_single_target which are illustrated in Table6 and Table 7 respectively. relax(u, v, E): 1: e get_edge(u, v, E) if (v.... ..."

Table 1: Cycle-weight Ratio for Edges in

in Coupling-based class integration and test order
by Aynur Abdurazik, Jeff Offutt 2006
"... In PAGE 4: ... Steps 2 and 3 flnd the following 11 cycles in the SCC. Table1 shows the results from steps 4 through 7 of Algo- rithm 1. After the initial computation of CWR values for edges, the algorithm works in the following steps: A.... ..."
Cited by 1

Table 2. Runtimes for various triangle/edge ratios

in Self-Avoiding Walks over Adaptive Unstructured Grids
by Gerd Heber, Rupak Biswas, Guang R. Gao 1999
"... In PAGE 7: ... According to our description of the algorithm, one would suspect that the runtime may also depend on the triangle/edge ratio. The results in Table2 explore this possibility; however, the numbers clearly show that the dependence of the execution time on the triangle/edge ratio is negligible and con rm our complexity estimate for the algorithm. A standard parallelization of the deterministic construction algorithm would be based on the observation that if the extensions of an existing PSAW did not interfere with one another, then they could be done in parallel.... ..."
Cited by 20

Table 7: Performance of the edge change ratio in detecting various edit types.

in Comparison of automatic shot boundary detection algorithms
by Rainer Lienhart 1999
Cited by 58

Table 2: Compression ratios for collections of files using estimated edge weights.

in Compressing File Collections with a TSP-Based Approach
by Dimitre Trendafilov, Nasir Memon, Torsten Suel, Dimitre Trendafilov, Nasir Memon, Torsten Suel
"... In PAGE 7: ...able 1 contains results based on using exact edge weights, i.e., the weight for edge a4 a21 a12 a23 a31a6 was computed as the benefit of delta compression over gzip: a7a9a50 a24 a64 a4 a23 a31a6 a55 a50 a5a39a3a46a44 a23a25a43 a4 a21 a12 a23 a31a6 . For the results in Table2 we used sampling to estimate file similarity, as described in [2] and used in [15]. An exception is the column for tsp2, where the selection of the second reference file was done by brute force using zdelta, although this could also be done based on faster estimation techniques.... ..."

Table 1: Compression ratios for collections of files using exact edge weights.

in Compressing File Collections with a TSP-Based Approach
by Dimitre Trendafilov, Nasir Memon, Torsten Suel, Dimitre Trendafilov, Nasir Memon, Torsten Suel
"... In PAGE 7: ... We first present results for compressing collections using delta compression techniques as de- scribed in Section 3. In Table1 , we compare five different methods for compressing the collections: a0 cat+gzip: concatenate the files from the collection and compress them with gzip a0 cat+bzip2: concatenate the files from the collection and compress them with bzip2 a0 ob: compute an optimal branching and compress using zdelta with a single reference file a0 tsp: compute a TSP ordering and compress using zdelta with a single reference file a0 tsp2: compute TSP ordering and compress using zdelta with two reference files Table 1 contains results based on using exact edge weights, i.e.... In PAGE 7: ... We first present results for compressing collections using delta compression techniques as de- scribed in Section 3. In Table 1, we compare five different methods for compressing the collections: a0 cat+gzip: concatenate the files from the collection and compress them with gzip a0 cat+bzip2: concatenate the files from the collection and compress them with bzip2 a0 ob: compute an optimal branching and compress using zdelta with a single reference file a0 tsp: compute a TSP ordering and compress using zdelta with a single reference file a0 tsp2: compute TSP ordering and compress using zdelta with two reference files Table1 contains results based on using exact edge weights, i.e.... ..."

Table 5. Edge ratios (white) and frequency (shaded) for ADT.

in
by unknown authors

Table 6. Edge ratios (white) and frequency (shaded) for ASE.

in
by unknown authors

TABLE IV PERFORMANCE OF GENERALIZED SEARCHING FOR VARIOUS ASSIGNMENTS OF EDGE CRITICALITY.

in Hybrid search schemes for unstructured peer-to-peer networks
by Christos Gkantsidis, Milena Mihail 2005
Cited by 33

TABLE 1. Velocities (left columns for magnetosphere and disk) are normalized to the magnetospheric Alfv en velocity, the fastest poloidal velocity, which limits the time-step in the relaxation runs together with the desired spatial resolution. The Alfv en speed in the disk is roughly the one given above for a rather weak magnetic eld. The right columns show the velocities divided by the Keplerian velocity vK. The ratio cs=vK determines the accretion disk thickness z0 divided by the distance from the star (z0=r0 apos; cs=vK) and is also comparable to the assumptions of the Shakura and Sunyaev model. For star we use a xed value of 0:8pGM=(RNr0)3 = 0:8VK(R0)=R0 to repre- sent the case of a fast rotator with the plasma of the magnetosphere rotating slower than the Keplerian velocity at the inner disk edge. G is the gravitational constant. Figure 1 shows the magnetic eld for the case where the disk eld is parallel to the dipole moment.

in The Equilibrium Structure of the Boundary Layer Between the Magnetosphere and the Accretion Disk of an Aligned Rotator
by L. Rastätter, K. Schindler
Results 1 - 10 of 25,978