### Table 1: Statistics of 2-level, multi-way partitionings of A741.

1999

"... In PAGE 3: ... Figures 4(a), 5(a) and 5(b) show, respectively, the results of 2-way, 3-way and 4-way balanced partitionings of A741, where each partitioned subcircuit is marked by an index (I up to IV). Table1 summarizes the statistics of these partitionings. Columns 1, 2 and 3 list, respectively, the number of subcircuits, the span/number of cut nets, and the number of nets in a balanced subcircuit.... ..."

Cited by 1

### Table IV. Cuts and Optimal (Percentage above lower bound) Jobs,Machines Range LR{Heur Cuts Optimum

1994

Cited by 12

### Table3 Cutting conditions

"... In PAGE 4: ...PSO is used to optimize the cutting parameters when a NC program is to be generated. To demonstrate the effectiveness of PSO in cutting parameters optimization, a controlled cutting experiment under the same cutting conditions ( Table3 ) was conducted without and with optimum parameters, respectively. The surface to cut is cylindrical so that cutting depth can continuously change (Fig.... ..."

### Table 7: Effect of pipelining on the performance of Multiway And

"... In PAGE 18: ... For a MULTIWAY AND operation with n operands, the depth of the pipeline is dlog2 ne. In Table7 , we present results for various values of n, and hence various pipeline depths. We observe from Table 7 that for s1423 , the pipelining technique does not improve the performance.... In PAGE 18: ... In Table 7, we present results for various values of n, and hence various pipeline depths. We observe from Table7 that for s1423 , the pipelining technique does not improve the performance. This is due to the fact that output BDDs for s1423 fit in the main memory and hence pipelining cannot improve the memory access.... ..."

### Table 1: Scene cut detection at P pictures

"... In PAGE 3: ...hreshold was set to 0.6 . These two parameters was adjusted in the other two sequences for the optimum results. Table1 and 2 list these two parameters setting along with the simulation results. As it can be seen from table 1, the scene cuts at P pictures were correctly detected with 100%, 90% and 87% for \Test 1 quot;, \Test 2 quot; and \Test 3 quot; sequences re- spectively.... ..."

### Table 1: Experiments. Relevancy rate = of nodes that had at least one of our cutting planes, how many had at least one of them binding at the LP optimum.

2006

"... In PAGE 13: ... There are 20 such instances. Surprisingly, nogood learning does not seem to help in MIP: it provides little reduction in tree size ( Table1 ). Fortunately, the time overhead (measured by doing all the steps, but not inserting the generated cutting planes) averaged only 6.... In PAGE 13: ... First, few nogoods are generated. Nodes are rarely pruned by infeasibility ( Table1 ), where our technique is strongest. In the 3SAT-based instances, pruning by infeasibility was more common, and accordingly our technique was more effective.... In PAGE 13: ... In the 3SAT-based instances, pruning by infeasibility was more common, and accordingly our technique was more effective. When nodes were pruned by bounding, our technique was rarely able to generate a nogood ( Table1 , column 7). The objective bounding constraint requires so many variables to be fixed before implications can be drawn from it that in practice implications will rarely be drawn even when the LP prunes the node by bounding.... In PAGE 13: ... There- fore, by the reasoning above, the cutting plane will be weak. This is reflected by the relevancy rate in Table1 . The cutting planes are least weak on the 3SAT-based instances; this is unsurprising since the 3SAT constraints are sparse compared to those in the other problems.... ..."

Cited by 2

### Table 4: Comparison of various bottom-up clustering algorithms based on various metrics. Algorithms in comparison include Absorption (ABS) [18], Density (DEN) [6, 10], Rent Parameter (REP) [15], Multiway Ratio Cut (MRC) [19], Closeness (CLO) [17], Connectivity (CON) [16], Random (RAN) [11], Modi ed Hyperedge Coarsening (MHC) [12], and Edge Separability (ESC) based method.

2000

"... In PAGE 15: ...4 for Closeness [17] scheme. We observe the e ectiveness of our global connectivity based ESC algorithm from the experimental result summerized in Table4 . In terms of FM cutsize comparison, ESC outperforms all other algorithms on Quickturn and IBM circuits and produce comparable result on small-scale MCNC circuits.... ..."

Cited by 41

### TABLE 38.3. Binary vs. Multi-way Splits Binary Multi-way Gain

1997

Cited by 25

### Table B-1. Cost summary - improved technology at optimum production rates Computation of Unit Cost

### Table 1: Comparison of multi-way voting protocols

2003

"... In PAGE 6: ... We compare the two types of multi-way voting protocols briefly. Column #ciphertext in Table1 shows the number of ciphertexts each voter has to compute and publish. The next column, PMP, shows the number x such that each voter performs 1-out-of-x PMP for each ciphertext.... ..."

Cited by 3