Results 1 - 10
of
346,863
Table 2: Extracted query modifications from personal home page data with desired precision set to 50%.
Table 3: Extracted query modifications from conference page data with desired precision set to 50%.
Table 1: Keytransformationsusedin theVHL.Manymoretransformationsareused duringcalibration(thus the skippednumbers).
1999
"... In PAGE 3: ... Some of these calibrations can be collapsed to reduce the number of transformations needed during operation of the VHL. Table1 shows the key transformations in the style of Tuceryan et al. [22].... ..."
Cited by 13
Table VI. The Supervised-Learning Technique Used in Training ScorePage Network. See text for explanation of desired output values used during training.
2002
Table VI. The Supervised-Learning Technique Used in Training ScorePage Network. See text for explanation of desired output values used during training.
Table IV. The Supervised-Learning Technique Used in Training ScoreThisPage Network. See text for explanation of desired output values used during training.
Table 8. Desired Eigenvectors
"... In PAGE 12: ... The approach used to specify eigenvectors was to set each element of the eigenvector to be 0 or 1 as appropriate to achieve the desired decoupling of the aircraft rigid-body modes. Initial choices for eigenvectors were chosen as shown in Table8 . In this table, the quot;x quot; indicates elements not weighted in the cost function and therefore are free to be determined by the eigenspace assignment algorithm.... ..."
Table 1 E ect of Problem Size on Convergence Rate Note: Each two-grid MGCG method is implemented twice for a sample problem: once on a small mesh of 17;289 unknowns and once on a larger mesh of 126;225 unknowns. Variants of MGCG di er from each other in the number of coarse-grid relaxation passes. nl=ns is a measure of independence of each method from mesh size. Iterative
"... In PAGE 16: ...2, we were able to run the two-grid MGCG methods on two di erent mesh discretizations of the same problem. Table1 shows the number of iterations, ns and nl, necessary for the various methods (including DCG and ICCG) to reach convergence on the small problem (17,289 unknowns) and on the \large quot; problem (126,225 unknowns), respectively. For a method truly independent of mesh size, the ratio of these two, nl=ns, would be 1.... ..."
Table 2: Possible Desires and Values in the Debate No. Desire Value Condition to be
2005
"... In PAGE 4: ... We also need to associate these desires with a value, and a degree to which the satisfaction of the desire promotes the value. For now we list the set of desires, conditions and val- ues in Table2 below and we will go on to discuss degrees of promotion in the next section. Based upon the beliefs and desires given in the above ta- bles, each agent can provide one or more instantiation of AS1.... ..."
Cited by 5
Table 1: DESIRE corpus statistics
2004
"... In PAGE 3: ... For a starting basis the corpus collected by the DESIRE Team Aachen3 consisting of 1399 sentences in DGS and German was investigated as it was one of the biggest avail- able for us. Table1 shows the details of this corpus, where singletons are words occurring only once. Note the very high number of singletons.... ..."
Cited by 8
Results 1 - 10
of
346,863