Results 1 - 10 of 40,066

Table 3. Third scenario: single huge task

in A Simulator For Load Balancing Analysis
by In Distributed Systems, Mihai Horia Zaharia, Florin Leon, Dan Gâlea

Table 2 Performance of the proposed hybrid intelligent system tested for both source databases using different training schemes (cross validation/complete set)a

in An Automatic Microcalcification Detection System Based on Hybrid Neural Network Classifier
by A. Papadopoulos, D.I. Fotiadis, A. Likas
"... In PAGE 12: ...18 false positive clusters per image, the sensitivity value obtained is 0.96 ( Table2 ).... In PAGE 13: ...90 was 4.25 false positive clusters per image ( Table2 ). The total number of ROIs has been classified as 102 TP, 163 TN, 170 FP and 11 FN cases.... In PAGE 14: ...training and testing) the sensitivity improves to 0.94 at the specificity level of 0.92 or 0.65 false positive clusters per image ( Table2 ).... In PAGE 14: ...91, the specificity is 3.0 false positive clusters per image ( Table2 ). The total number of ROIs has been classified as 31 TP, 99 TN, 60 FP and 3 FN cases.... ..."

Table 1 shows that there is a huge difference in the timing with regard to the actual distance. Also calculating the distance with the obtained timing is by no means straight forward.

in Using time-of-flight for WLAN localization: feasibility study
by Kavitha Muthukrishnan, Georgi Koprinkov, Nirvana Meratnia, Maria Lijding
"... In PAGE 4: ... Table1 . Results of the time measurement at the network layer 3.... ..."

Table 5: Results for huge instances

in 0-1 Reformulations of the Multicommodity Capacitated Network Design Problem
by Antonio Frangioni, Bernard Gendron 2007

Table 2: Simulation results - single intersection network

in Adaptive Look-ahead Optimization of Traffic Signals
by Isaac Porche, Stéphane Lafortune 1997
"... In PAGE 18: ... The data from a set of simulation experiments is included in this section. A summary of results is shown in Table2 with details shown in the appendix. A single isolated intersection with two con icting approaches is used.... ..."
Cited by 2

Table 1: Simulation results - single intersection network

in Adaptive Look-ahead Optimization of Traffic Signals
by I. Porche, S. Lafortune
"... In PAGE 17: ... The data from a set of simulation experiments is included in this section. A summary of results is shown in Table1 with details shown in Appendix B. A single isolated intersection with two con icting approaches is used.... In PAGE 18: ... An additional test with a time-varying demand (shown in Fig. 9) is also performed (last column of Table1 ). Certainly for this time-varying case, a xed-cycle signal plan could not perform as well.... ..."

Table III. Network Trafilc for a Single User

in MASSIVE: A Co Environment for Iaborative Virtual
by Chris Greenhalgh, Steven Benford

Table 1: Consumption of the SPUD auction mechanism relative to the CNET mechanism. Interval 1/single 3/single 5/single 1/network 3/network 5/network

in Agents for Market-Based Computational-Resource Allocation
by Brecht Reggers, Floris Wiesman, Nico Roos
"... In PAGE 6: ... Different numbers of sub-clients were used and a difference was made between running on a single node and running on the network. Table1 shows the overhead in consumption of the SPUD auction mechanism as a percentage of the overhead of the CNET mechanism. Hence, values greater than 100% indicate SPUD has consumed more resources than CNET.... ..."

Table 2. Huge size data set

in On the combination of evolutionary algorithms and stratified strategies for training set selection in data mining
by Jose Ramon Cano, Francisco Herrera, Manuel Lozano 2006
Cited by 2

Table 4, there is a huge improvement if the entries of the nodes are

in Efficient Processing of Spatial Joins
by Thoinus Brinkhoff, Hans-peter Kriegel, Bernhard Seeger
"... In PAGE 7: ... Due to a limited size of the buffer, a page may have to be read and sorted more than once. The repeat-factor in Table4 gives the number how often a page can be sorted on the average until the performance of the join witbout sorting is better than the perfor- mance of the join with sorting (both joins with restricting the search space). For example, in case of 4Kbyte pages, a page has to be read and sorted more than 10 times until the sorted version of the join is less efficient than the version without sorting.... ..."
Results 1 - 10 of 40,066